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 listFeb 20, 2026 19:39wnwnScore: 5,000Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 20, 2026 19:394,94262,930,56039,015,0002,000,0002,494,464
2Feb 20, 2026 19:394,98762,476,82940,387,0001,009,0002,277,376
3Feb 20, 2026 19:394,98861,833,84640,392,0001,009,0002,498,560
4Feb 20, 2026 19:394,99160,163,20640,417,0001,010,0002,535,424
5Feb 20, 2026 19:395,00067,701,48540,490,0001,012,0002,277,376
6Feb 20, 2026 19:395,00461,331,72440,519,0001,012,0002,535,424
7Feb 20, 2026 19:395,01169,598,69540,575,0001,014,0002,277,376
8Feb 20, 2026 19:395,02165,850,44440,658,0001,016,0002,277,376
9Feb 20, 2026 19:398,95797,372,03773,341,0001,004,0002,277,376