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 15, 2026 22:27wnwnScore: 10,088Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 15, 2026 22:278,864101,265,11965,510,0008,062,0002,461,696
2Feb 15, 2026 22:278,991103,823,23365,550,0009,076,0002,433,024
3Feb 15, 2026 22:278,99699,797,52464,710,0009,955,0002,461,696
4Feb 15, 2026 22:2710,088114,912,21675,758,0007,974,0002,433,024
5Feb 15, 2026 22:2710,093113,991,22577,785,0005,983,0002,342,912
6Feb 15, 2026 22:2710,127106,825,17776,048,0008,005,0002,527,232