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 24, 2026 05:00wnwnScore: 3,419Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 05:003,29736,139,18826,356,0001,013,0002,113,536
2Sep 24, 2026 05:003,31836,354,12726,536,0001,007,0002,113,536
3Sep 24, 2026 05:003,32336,204,23826,480,0001,109,0002,113,536
4Sep 24, 2026 05:003,34136,476,09826,696,0001,039,0002,113,536
5Sep 24, 2026 05:003,41937,145,46927,348,0001,032,0002,113,536
6Sep 24, 2026 05:003,44137,151,96027,553,0001,011,0002,113,536
7Sep 24, 2026 05:003,46038,184,74027,719,0001,001,0002,113,536
8Sep 24, 2026 05:003,46637,481,32127,737,0001,032,0002,113,536
9Sep 24, 2026 05:003,50338,475,82728,046,0001,032,0002,113,536