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 20, 2026 02:22Serhii SakhnoSerhii SakhnoScore: 73,074Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 20, 2026 02:2272,984627,749,864603,768,0001,999,0002,293,760
2Feb 20, 2026 02:2273,012631,826,399604,006,0001,996,0002,289,664
3Feb 20, 2026 02:2273,038634,640,273605,219,0001,000,0002,293,760
4Feb 20, 2026 02:2273,074634,146,109604,519,0001,998,0002,535,424
5Feb 20, 2026 02:2273,222629,578,396605,744,0001,999,0002,281,472
6Feb 20, 2026 02:2273,287638,293,424606,279,0002,000,0002,289,664