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 18, 2026 21:25lipapipalipapipaScore: 6,240Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 18, 2026 21:256,10179,902,44348,611,0002,025,0002,506,752
2Feb 18, 2026 21:256,21377,439,42949,542,0002,022,0002,334,720
3Feb 18, 2026 21:256,22282,874,04950,634,0001,012,0002,306,048
4Feb 18, 2026 21:256,24079,686,50649,797,0001,991,0002,318,336
5Feb 18, 2026 21:256,24376,496,62048,824,0002,989,0002,342,912
6Feb 18, 2026 21:256,38877,984,90451,019,0002,000,0002,498,560