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 14, 2026 07:43Daniel MastalerzDaniel MastalerzScore: 6,914Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 14, 2026 07:436,78776,928,03752,312,0004,024,0002,265,088
2Feb 14, 2026 07:436,78978,802,44852,321,0004,024,0002,265,088
3Feb 14, 2026 07:436,80481,627,74851,434,0005,042,0002,342,912
4Feb 14, 2026 07:436,91479,651,75855,374,0002,013,0002,306,048
5Feb 14, 2026 07:436,91879,885,41154,400,0003,022,0002,318,336
6Feb 14, 2026 07:436,93885,639,99952,531,0005,051,0002,322,432