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:07Josu San MartinJosu San MartinScore: 6,886Success
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:076,82766,050,27751,418,0005,252,0002,113,536
2Jul 3, 2026 19:076,84866,257,19351,487,0005,352,0002,113,536
3Jul 3, 2026 19:076,85766,395,71451,572,0005,344,0002,113,536
4Jul 3, 2026 19:076,88266,513,67751,778,0005,345,0002,113,536
5Jul 3, 2026 19:076,88666,540,10951,970,0005,189,0002,113,536
6Jul 3, 2026 19:076,90966,758,18251,995,0005,356,0002,113,536
7Jul 3, 2026 19:076,92066,821,28652,090,0005,350,0002,113,536
8Jul 3, 2026 19:076,94767,098,06552,244,0005,424,0002,113,536
9Jul 3, 2026 19:076,95367,083,51952,206,0005,512,0002,113,536