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:24Josu San MartinJosu San MartinScore: 6,485Success
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:246,41862,591,35549,097,0004,173,0002,113,536
2Jul 3, 2026 20:246,45462,978,85649,293,0004,279,0002,113,536
3Jul 3, 2026 20:246,46863,081,94949,536,0004,153,0002,113,536
4Jul 3, 2026 20:246,48263,151,69749,689,0004,115,0002,113,536
5Jul 3, 2026 20:246,48563,242,21449,578,0004,251,0002,113,536
6Jul 3, 2026 20:246,48863,297,19449,549,0004,308,0002,113,536
7Jul 3, 2026 20:246,50163,487,99548,781,0005,182,0002,113,536
8Jul 3, 2026 20:246,50863,387,43549,748,0004,274,0002,113,536
9Jul 3, 2026 20:246,57165,194,86650,234,0004,309,0002,113,536