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 7, 2026 08:30wnwnScore: 3,594Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 7, 2026 08:313,38744,910,14027,058,0001,055,0002,486,272
2May 7, 2026 08:313,39942,658,23027,128,0001,085,0002,486,272
3May 7, 2026 08:313,41141,370,61027,252,0001,062,0002,473,984
4May 7, 2026 08:313,56846,294,09128,550,0001,072,0002,486,272
5May 7, 2026 08:313,59446,009,41428,740,0001,098,0002,494,464
6May 7, 2026 08:313,59547,036,58528,730,0001,110,0002,486,272
7May 7, 2026 08:313,59954,913,81728,738,0001,138,0002,473,984
8May 7, 2026 08:313,60646,631,57528,852,0001,086,0002,473,984
9May 7, 2026 08:313,61948,030,62928,962,0001,081,0002,494,464