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 4, 2026 01:02Josu San MartinJosu San MartinScore: 5,205Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 01:025,08651,542,94238,916,0003,301,0002,113,536
2Jul 4, 2026 01:025,10751,748,83738,995,0003,400,0002,113,536
3Jul 4, 2026 01:025,13452,053,98139,448,0003,168,0002,113,536
4Jul 4, 2026 01:025,19752,506,49239,667,0003,470,0002,113,536
5Jul 4, 2026 01:025,20552,621,70439,792,0003,410,0002,113,536
6Jul 4, 2026 01:025,37353,959,17741,142,0003,456,0002,113,536
7Jul 4, 2026 01:025,38854,111,03141,274,0003,452,0002,113,536
8Jul 4, 2026 01:025,48354,966,14141,925,0003,592,0002,113,536
9Jul 4, 2026 01:025,52155,224,94942,748,0003,081,0002,117,632