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 17, 2026 02:24Andrew EpsteinAndrew EpsteinScore: 51,125Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 17, 2026 02:2551,042436,181,159420,451,0003,203,0002,121,728stderr
2Sep 17, 2026 02:2551,059434,193,507421,677,0002,119,0002,121,728stderr
3Sep 17, 2026 02:2551,077434,790,865421,687,0002,257,0002,121,728stderr
4Sep 17, 2026 02:2551,083435,116,963421,735,0002,257,0002,117,632stderr
5Sep 17, 2026 02:2551,125434,657,965422,096,0002,246,0002,117,632stderr
6Sep 17, 2026 02:2551,147434,915,490422,384,0002,142,0002,121,728stderr
7Sep 17, 2026 02:2551,281436,247,392423,377,0002,262,0002,121,728stderr
8Sep 17, 2026 02:2551,306436,214,381423,597,0002,247,0002,121,728stderr
9Sep 17, 2026 02:2551,497438,502,762425,168,0002,265,0002,117,632stderr