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:04Josu San MartinJosu San MartinScore: 4,213Success
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:044,19145,042,77633,756,0001,035,0002,113,536
2May 10, 2026 14:044,19542,396,81833,785,0001,041,0002,113,536
3May 10, 2026 14:044,19745,840,13133,797,0001,042,0002,113,536
4May 10, 2026 14:044,20743,960,71933,872,0001,050,0002,113,536
5May 10, 2026 14:044,21344,725,43933,933,0001,040,0002,113,536
6May 10, 2026 14:044,21642,671,57233,952,0001,047,0002,113,536
7May 10, 2026 14:044,23142,369,49334,083,0001,036,0002,113,536
8May 10, 2026 14:044,24442,539,49034,184,0001,044,0002,113,536
9May 10, 2026 14:044,34645,401,24234,919,0001,157,0002,113,536