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 09:39Aleksei ShahoikaAleksei ShahoikaScore: 12,620Success
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 09:4012,553115,966,07682,217,00021,978,0002,113,536
2May 18, 2026 09:4012,559116,127,04082,368,00021,878,0002,113,536
3May 18, 2026 09:4012,565116,583,87382,396,00021,899,0002,113,536
4May 18, 2026 09:4012,608115,964,17182,535,00022,118,0002,113,536
5May 18, 2026 09:4012,620115,874,30182,703,00022,050,0002,113,536
6May 18, 2026 09:4012,659116,001,99283,078,00021,999,0002,113,536
7May 18, 2026 09:4012,672115,613,29882,868,00022,314,0002,113,536
8May 18, 2026 09:4012,752115,236,07583,013,00022,832,0002,113,536
9May 18, 2026 09:4012,875119,857,35683,072,00023,796,0002,113,536