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 listJan 28, 2026 16:06lipapipalipapipaScore: 13,736Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 28, 2026 16:0613,224140,245,778105,734,0004,027,0002,527,232
2Jan 28, 2026 16:0613,383134,476,280109,078,0002,001,0002,523,136
3Jan 28, 2026 16:0613,508141,745,044110,116,0002,002,0002,281,472
4Jan 28, 2026 16:0613,540147,322,097111,380,0001,003,0002,281,472
5Jan 28, 2026 16:0613,736140,297,650110,011,0004,000,0002,490,368
6Jan 28, 2026 16:0613,741140,115,110110,047,0004,001,0002,285,568
7Jan 28, 2026 16:0613,875140,721,825112,156,0003,004,0002,265,088
8Jan 28, 2026 16:0613,899142,692,924114,356,0001,003,0002,527,232
9Jan 28, 2026 16:0614,145138,752,747115,395,0002,006,0002,281,472