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 listApr 5, 2026 20:35wnwnScore: 4,279Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 5, 2026 20:354,24761,120,58234,245,0001,007,0002,277,376
2Apr 5, 2026 20:344,25056,778,57934,267,0001,007,0002,494,464
3Apr 5, 2026 20:344,27754,899,36034,488,0001,014,0002,535,424
4Apr 5, 2026 20:344,27956,091,20734,500,0001,014,0002,277,376
5Apr 5, 2026 20:354,27959,987,89834,501,0001,014,0002,277,376
6Apr 5, 2026 20:354,28463,991,62634,542,0001,015,0002,498,560
7Apr 5, 2026 20:354,28660,370,09734,558,0001,016,0002,494,464
8Apr 5, 2026 20:354,29962,148,00834,659,0001,019,0002,490,368
9Apr 5, 2026 20:354,32063,700,34634,859,000995,0002,277,376