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 listMar 10, 2026 19:29wnwnScore: 4,401Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 10, 2026 19:294,34055,990,53634,017,0002,001,0002,273,280
2Mar 10, 2026 19:304,34958,090,62834,095,0002,005,0002,494,464
3Mar 10, 2026 19:294,35866,344,54334,165,0002,009,0002,498,560
4Mar 10, 2026 19:304,40162,872,68235,513,0001,014,0002,486,272
5Mar 10, 2026 19:294,40867,136,04735,568,0001,016,0002,273,280
6Mar 10, 2026 19:304,41163,232,08435,596,0001,017,0002,490,368