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 11, 2026 14:02Victor MerckléVictor MerckléScore: 3,993Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 11, 2026 14:033,92341,002,23231,483,0001,086,0002,117,632stderr
2Aug 11, 2026 14:033,93641,109,52331,619,0001,050,0002,117,632stderr
3Aug 11, 2026 14:033,95841,216,73631,827,0001,032,0002,117,632stderr
4Aug 11, 2026 14:033,97741,397,59931,968,0001,047,0002,117,632stderr
5Aug 11, 2026 14:033,99341,539,54932,104,0001,041,0002,117,632stderr
6Aug 11, 2026 14:034,00441,621,70832,202,0001,036,0002,117,632stderr
7Aug 11, 2026 14:034,03041,868,38732,430,0001,022,0002,117,632stderr
8Aug 11, 2026 14:034,08642,327,00932,805,0001,111,0002,117,632stderr
9Aug 11, 2026 14:034,08842,387,64532,818,0001,116,0002,117,632stderr