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 8, 2026 05:56caandocaandoScore: 10,221Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 8, 2026 05:569,26999,312,71675,937,000999,0002,281,472
2Mar 8, 2026 05:569,303102,677,05776,213,0001,002,0002,281,472
3Mar 8, 2026 05:569,31198,460,89376,281,0001,003,0002,523,136
4Mar 8, 2026 05:5610,221115,280,76382,842,0001,996,0002,510,848
5Mar 8, 2026 05:5610,253106,714,58484,099,0001,001,0002,527,232
6Mar 8, 2026 05:5610,285111,132,13284,361,0001,004,0002,523,136