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 listApr 21, 2026 18:52Yuriy LyfenkoYuriy LyfenkoScore: 4,332Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 21, 2026 18:524,29452,782,41834,624,0001,018,0002,473,984
2Apr 21, 2026 18:524,31551,593,27333,826,0001,989,0002,465,792
3Apr 21, 2026 18:524,32151,010,48333,879,0001,992,0002,330,624
4Apr 21, 2026 18:524,32252,063,14233,881,0001,993,0002,330,624
5Apr 21, 2026 18:524,33252,776,31733,964,0001,997,0002,461,696
6Apr 21, 2026 18:524,33348,414,40533,969,0001,998,0002,465,792
7Apr 21, 2026 18:524,33457,684,78133,980,0001,998,0002,465,792
8Apr 21, 2026 18:524,33553,481,82833,989,0001,999,0002,465,792
9Apr 21, 2026 18:524,35551,661,39434,142,0002,008,0002,461,696