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 19, 2026 00:32Ondřej PolaneckýOndřej PolaneckýScore: 11,338Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 19, 2026 00:3211,314118,021,72991,912,0001,998,0002,289,664
2Mar 19, 2026 00:3211,316119,372,86891,926,0001,998,0002,269,184
3Mar 19, 2026 00:3211,329122,564,15093,033,0001,000,0002,265,088
4Mar 19, 2026 00:3211,333119,138,03592,060,0002,001,0002,265,088
5Mar 19, 2026 00:3211,338118,980,59292,100,0002,002,0002,392,064
6Mar 19, 2026 00:3211,341115,250,59492,126,0002,002,0002,277,376
7Mar 19, 2026 00:3211,343115,037,93492,146,0002,003,0002,289,664
8Mar 19, 2026 00:3211,347116,355,13892,174,0002,003,0002,277,376
9Mar 19, 2026 00:3211,366123,829,96993,336,0001,003,0002,289,664