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 5, 2026 23:01rubanrubanScore: 22,941Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 5, 2026 23:0122,268210,800,162182,828,0001,998,0002,289,664
2Feb 5, 2026 23:0122,424209,668,160185,120,0001,000,0002,363,392
3Feb 5, 2026 23:0122,763212,128,819186,931,0001,999,0002,285,568
4Feb 5, 2026 23:0122,935216,223,885190,358,00002,289,664
5Feb 5, 2026 23:0122,941211,276,486189,407,0001,002,0002,285,568
6Feb 5, 2026 23:0122,942219,506,205189,417,0001,002,0002,289,664
7Feb 5, 2026 23:0122,943213,265,753189,423,0001,002,0002,289,664
8Feb 5, 2026 23:0122,943212,984,595189,426,0001,002,0002,289,664
9Feb 5, 2026 23:0122,953216,788,561190,506,00002,289,664