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 listFeb 28, 2026 00:56ccScore: 2,020,862Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 28, 2026 00:562,020,01816,804,298,71716,703,182,00062,970,0002,281,472
2Feb 28, 2026 00:562,020,64916,803,172,72616,707,415,00063,970,0002,281,472
3Feb 28, 2026 00:562,020,67116,801,393,12716,696,607,00074,966,0002,289,664
4Feb 28, 2026 00:562,020,81416,807,429,59116,700,789,00071,968,0002,281,472
5Feb 28, 2026 00:562,020,86216,810,636,35116,708,174,00064,977,0002,281,472
6Feb 28, 2026 00:562,022,29016,816,885,46916,711,046,00073,964,0002,281,472
7Feb 28, 2026 00:562,024,51316,831,307,86116,747,481,00055,978,0002,281,472
8Feb 28, 2026 00:562,024,75316,840,081,48716,736,482,00068,964,0002,281,472
9Feb 28, 2026 00:562,024,83916,837,084,10216,743,188,00062,974,0002,281,472