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 listAug 30, 2026 19:50Josu San MartinJosu San MartinScore: 5,157Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 30, 2026 19:505,11051,437,82141,295,0001,122,0002,113,536
2Aug 30, 2026 19:505,11551,560,40041,333,0001,126,0002,113,536
3Aug 30, 2026 19:505,11851,038,70441,351,0001,135,0002,113,536
4Aug 30, 2026 19:505,14351,220,06141,573,0001,120,0002,113,536
5Aug 30, 2026 19:505,15751,252,37641,668,0001,139,0002,113,536
6Aug 30, 2026 19:505,15851,844,31641,675,0001,138,0002,113,536
7Aug 30, 2026 19:505,16952,074,57041,760,0001,148,0002,113,536
8Aug 30, 2026 19:505,25552,099,10442,487,0001,130,0002,113,536
9Aug 30, 2026 19:505,27752,208,74742,685,0001,119,0002,113,536