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 18:05Josu San MartinJosu San MartinScore: 5,305Success
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 18:065,17650,956,90841,909,0001,056,0002,113,536
2May 10, 2026 18:065,20753,885,88342,160,0001,059,0002,113,536
3May 10, 2026 18:065,22050,834,28142,271,0001,060,0002,113,536
4May 10, 2026 18:065,22752,605,17642,321,0001,069,0002,113,536
5May 10, 2026 18:065,30553,691,59242,963,0001,069,0002,113,536
6May 10, 2026 18:065,32654,983,08443,152,0001,058,0002,113,536
7May 10, 2026 18:065,35451,744,24343,404,0001,038,0002,113,536
8May 10, 2026 18:065,44152,613,08144,101,0001,061,0002,113,536
9May 10, 2026 18:065,58455,564,01345,313,0001,039,0002,113,536