Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listAug 10, 2026 12:04Victor MerckléVictor MerckléScore: 5,252Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 10, 2026 12:055,19152,149,79542,080,0001,012,0002,117,632stderr
2Aug 10, 2026 12:055,22752,453,94942,374,0001,017,0002,117,632stderr
3Aug 10, 2026 12:055,22952,474,03042,392,0001,013,0002,117,632stderr
4Aug 10, 2026 12:055,23452,464,49442,279,0001,166,0002,117,632stderr
5Aug 10, 2026 12:055,25251,995,27542,445,0001,147,0002,117,632stderr
6Aug 10, 2026 12:055,25553,851,66142,611,0001,013,0002,117,632stderr
7Aug 10, 2026 12:055,26653,193,06242,698,0001,015,0002,117,632stderr
8Aug 10, 2026 12:055,26852,096,55442,696,0001,031,0002,117,632stderr
9Aug 10, 2026 12:055,27652,290,83442,772,0001,020,0002,117,632stderr