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 listJul 22, 2026 23:14Kevin HeaveyKevin HeaveyScore: 3,879Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 22, 2026 23:153,60639,799,68628,792,0001,146,0002,113,536
2Jul 22, 2026 23:153,61139,884,46028,859,0001,115,0002,113,536
3Jul 22, 2026 23:153,62139,881,11228,886,0001,173,0002,113,536
4Jul 22, 2026 23:153,65540,163,85029,184,0001,160,0002,113,536
5Jul 22, 2026 23:153,87942,049,46531,055,0001,147,0002,113,536
6Jul 22, 2026 23:153,89842,222,21631,216,0001,141,0002,113,536
7Jul 22, 2026 23:153,92543,136,36031,380,0001,198,0002,113,536
8Jul 22, 2026 23:153,94442,646,03431,700,0001,041,0002,113,536
9Jul 22, 2026 23:153,95242,672,30031,638,0001,167,0002,113,536