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 listMay 10, 2026 14:06Josu San MartinJosu San MartinScore: 4,187Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 14:074,18042,744,59533,647,0001,049,0002,113,536
2May 10, 2026 14:074,18042,360,40033,648,0001,052,0002,113,536
3May 10, 2026 14:074,18342,871,74033,635,0001,085,0002,113,536
4May 10, 2026 14:074,18644,432,34733,701,0001,048,0002,113,536
5May 10, 2026 14:074,18744,885,57233,697,0001,063,0002,113,536
6May 10, 2026 14:074,19844,539,09333,794,0001,056,0002,113,536
7May 10, 2026 14:074,27457,784,66234,405,0001,074,0002,113,536
8May 10, 2026 14:074,31043,358,92034,727,0001,051,0002,113,536
9May 10, 2026 14:074,39555,179,79535,360,0001,123,0002,113,536