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 19:32Josu San MartinJosu San MartinScore: 6,892Success
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 19:326,78467,053,94351,065,0005,245,0002,113,536
2Jul 3, 2026 19:326,84566,566,13051,558,0005,258,0002,113,536
3Jul 3, 2026 19:326,85366,639,10851,672,0005,216,0002,117,632
4Jul 3, 2026 19:326,88966,577,61951,905,0005,276,0002,113,536
5Jul 3, 2026 19:326,89266,634,09151,919,0005,292,0002,113,536
6Jul 3, 2026 19:326,91667,188,25852,042,0005,368,0002,113,536
7Jul 3, 2026 19:326,92266,867,91852,126,0005,328,0002,113,536
8Jul 3, 2026 19:326,95167,045,03152,356,0005,340,0002,113,536
9Jul 3, 2026 19:326,97567,282,58852,442,0005,451,0002,113,536