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 14, 2026 02:22Victor MerckléVictor MerckléScore: 7,290Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 14, 2026 02:227,28371,552,75060,450,00002,113,536
2May 14, 2026 02:227,28569,267,30460,469,00002,113,536
3May 14, 2026 02:227,28667,804,14860,482,00002,113,536
4May 14, 2026 02:227,28970,260,88459,500,0001,003,0002,113,536
5May 14, 2026 02:227,29070,297,11959,511,0001,004,0002,113,536
6May 14, 2026 02:227,29469,521,98259,536,0001,006,0002,113,536
7May 14, 2026 02:227,30470,679,72859,612,0001,014,0002,113,536
8May 14, 2026 02:227,34071,050,39559,890,0001,039,0002,113,536
9May 14, 2026 02:227,35370,065,06159,999,0001,035,0002,113,536