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:53Josu San MartinJosu San MartinScore: 6,604Success
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:536,55263,759,61349,112,0005,272,0002,113,536
2Jul 3, 2026 19:536,55765,087,51349,165,0005,260,0002,113,536
3Jul 3, 2026 19:536,55963,780,92349,177,0005,264,0002,113,536
4Jul 3, 2026 19:536,58064,007,78249,381,0005,241,0002,113,536
5Jul 3, 2026 19:536,60464,194,59449,549,0005,267,0002,113,536
6Jul 3, 2026 19:536,60764,146,96849,549,0005,292,0002,113,536
7Jul 3, 2026 19:536,61464,273,39749,723,0005,175,0002,113,536
8Jul 3, 2026 19:536,62064,363,32749,769,0005,180,0002,113,536
9Jul 3, 2026 19:536,63064,326,40949,773,0005,256,0002,113,536