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 25, 2026 23:32Victor MerckléVictor MerckléScore: 4,171Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 25, 2026 23:334,10942,463,50333,079,0001,031,0002,117,632stderr
2Aug 25, 2026 23:334,10942,513,95833,055,0001,055,0002,117,632stderr
3Aug 25, 2026 23:334,12842,651,42633,203,0001,064,0002,117,632stderr
4Aug 25, 2026 23:334,15842,910,90333,485,0001,027,0002,117,632stderr
5Aug 25, 2026 23:334,17143,109,15133,525,0001,097,0002,117,632stderr
6Aug 25, 2026 23:334,23543,570,41834,121,0001,035,0002,117,632stderr
7Aug 25, 2026 23:334,24743,679,12334,221,0001,036,0002,117,632stderr
8Aug 25, 2026 23:334,26344,058,14134,368,0001,022,0002,117,632stderr
9Aug 25, 2026 23:334,34144,448,48534,980,0001,054,0002,117,632stderr