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 14, 2026 09:07Victor MerckléVictor MerckléScore: 3,479Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 14, 2026 09:133,44538,956,02227,433,0001,162,0002,117,632stderr
2Sep 14, 2026 09:133,45739,121,84727,677,0001,023,0002,117,632stderr
3Sep 14, 2026 09:133,46140,066,56027,623,0001,106,0002,117,632stderr
4Sep 14, 2026 09:133,47438,614,47927,822,0001,019,0002,117,632stderr
5Sep 14, 2026 09:133,47939,280,00127,859,0001,017,0002,117,632stderr
6Sep 14, 2026 09:133,48039,358,04527,853,0001,036,0002,117,632stderr
7Sep 14, 2026 09:133,49338,836,71427,829,0001,164,0002,117,632stderr
8Sep 14, 2026 09:133,49638,745,13128,010,0001,014,0002,117,632stderr
9Sep 14, 2026 09:133,55340,056,76928,475,0001,017,0002,117,632stderr