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 listJan 3, 2026 02:07Josu San MartinJosu San MartinScore: 5,911Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 3, 2026 02:075,53774,056,81543,957,0001,998,0002,293,760
2Jan 3, 2026 02:075,86272,830,77548,657,00002,371,584
3Jan 3, 2026 02:075,89078,704,94246,891,0001,995,0002,371,584
4Jan 3, 2026 02:075,91176,811,09848,063,0001,001,0002,293,760
5Jan 3, 2026 02:075,92074,108,20847,133,0002,005,0002,510,848
6Jan 3, 2026 02:076,00376,238,89147,830,0001,992,0002,355,200