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 listMay 18, 2026 10:03Aleksei ShahoikaAleksei ShahoikaScore: 13,362Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 18, 2026 10:0413,218121,171,48687,521,00022,189,0002,113,536
2May 18, 2026 10:0413,247126,060,03687,711,00022,241,0002,113,536
3May 18, 2026 10:0413,252121,048,90987,717,00022,278,0002,113,536
4May 18, 2026 10:0413,302120,320,18388,137,00022,277,0002,113,536
5May 18, 2026 10:0413,362122,821,13788,851,00022,060,0002,113,536
6May 18, 2026 10:0413,410123,942,65688,774,00022,535,0002,113,536
7May 18, 2026 10:0413,420121,069,77689,122,00022,271,0002,113,536
8May 18, 2026 10:0413,487124,135,41688,182,00023,768,0002,113,536
9May 18, 2026 10:0413,508123,898,30888,481,00023,640,0002,113,536