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 6, 2026 20:00caandocaandoScore: 11,854Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 6, 2026 20:0010,972118,660,40389,068,0002,001,0002,281,472
2Mar 6, 2026 20:0010,978116,153,34589,118,0002,002,0002,281,472
3Mar 6, 2026 20:0010,996119,868,17489,259,0002,005,0002,523,136
4Mar 6, 2026 20:0011,854119,889,84797,385,0001,003,0002,281,472
5Mar 6, 2026 20:0011,862120,718,96697,450,0001,004,0002,523,136
6Mar 6, 2026 20:0011,863120,837,37798,461,00002,523,136