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 18, 2026 14:32wnwnScore: 5,911Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 18, 2026 14:325,84973,941,16347,536,0001,011,0002,273,280
2Mar 18, 2026 14:325,88272,994,29146,831,0001,992,0002,527,232
3Mar 18, 2026 14:325,89275,784,99346,909,0001,996,0002,486,272
4Mar 18, 2026 14:325,91174,166,63547,060,0002,002,0002,273,280
5Mar 18, 2026 14:325,94470,979,41347,324,0002,013,0002,273,280
6Mar 18, 2026 14:326,15573,628,52749,086,0002,003,0002,273,280