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 3, 2026 20:21Josu San MartinJosu San MartinScore: 8,575Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 20:218,52880,169,39464,070,0006,720,0002,117,632
2Jul 3, 2026 20:218,54981,579,12864,140,0006,821,0002,117,632
3Jul 3, 2026 20:218,57080,495,58264,246,0006,889,0002,117,632
4Jul 3, 2026 20:218,57080,532,95664,328,0006,804,0002,121,728
5Jul 3, 2026 20:218,57580,547,97764,229,0006,945,0002,121,728
6Jul 3, 2026 20:218,59980,758,64264,625,0006,752,0002,121,728
7Jul 3, 2026 20:218,60280,735,09864,601,0006,803,0002,121,728
8Jul 3, 2026 20:218,60780,704,78664,504,0006,937,0002,121,728
9Jul 3, 2026 20:218,62480,978,28964,684,0006,898,0002,117,632