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 08:14caandocaandoScore: 8,792Success
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 08:147,78888,933,61163,632,0001,010,0002,367,488
2Mar 8, 2026 08:147,79089,602,59064,659,00002,265,088
3Mar 8, 2026 08:147,80591,903,30662,786,0001,993,0002,523,136
4Mar 8, 2026 08:148,79295,144,42370,972,0001,999,0002,281,472
5Mar 8, 2026 08:148,79999,253,86272,030,0001,000,0002,281,472
6Mar 8, 2026 08:148,80697,055,01972,092,0001,001,0002,281,472