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 11, 2026 04:49Josu San MartinJosu San MartinScore: 3,876Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 04:493,85941,658,52830,960,0001,074,0002,113,536
2May 11, 2026 04:493,87039,718,61631,054,0001,070,0002,113,536
3May 11, 2026 04:493,87340,296,84831,066,0001,085,0002,113,536
4May 11, 2026 04:493,87342,132,22831,060,0001,086,0002,113,536
5May 11, 2026 04:493,87641,613,63131,115,0001,062,0002,113,536
6May 11, 2026 04:493,88040,053,35331,119,0001,092,0002,113,536
7May 11, 2026 04:493,88340,278,54431,171,0001,064,0002,113,536
8May 11, 2026 04:493,91840,327,20531,430,0001,095,0002,113,536
9May 11, 2026 04:493,96443,700,68131,825,0001,082,0002,113,536