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 listSep 8, 2026 20:45Victor MerckléVictor MerckléScore: 54,053Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 8, 2026 20:4953,860455,633,335445,909,0001,134,0002,117,632stderr
2Sep 8, 2026 20:4953,949456,136,955446,727,0001,050,0002,117,632stderr
3Sep 8, 2026 20:4954,010456,914,981446,170,0002,118,0002,117,632stderr
4Sep 8, 2026 20:4954,012456,945,604447,160,0001,141,0002,117,632stderr
5Sep 8, 2026 20:4954,053457,869,124447,645,0001,003,0002,117,632stderr
6Sep 8, 2026 20:4954,210459,105,716448,807,0001,138,0002,117,632stderr
7Sep 8, 2026 20:4954,310459,302,043449,631,0001,148,0002,117,632stderr
8Sep 8, 2026 20:4954,314459,392,292449,786,0001,024,0002,117,632stderr
9Sep 8, 2026 20:4954,362459,783,761450,203,0001,008,0002,117,632stderr