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 11, 2026 15:42wnwnScore: 3,330Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 15:433,29634,664,73827,362,00002,113,536
2May 11, 2026 15:433,30335,676,21927,418,00002,113,536
3May 11, 2026 15:433,31037,603,06326,466,0001,010,0002,113,536
4May 11, 2026 15:433,32734,930,41627,618,00002,113,536
5May 11, 2026 15:433,33036,723,10627,643,00002,113,536
6May 11, 2026 15:433,34037,275,57726,669,0001,058,0002,113,536
7May 11, 2026 15:433,42648,808,07927,436,0001,006,0002,113,536
8May 11, 2026 15:433,50636,452,24028,102,0001,004,0002,113,536
9May 11, 2026 15:433,51537,811,57128,157,0001,020,0002,113,536