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 listJan 4, 2026 17:53Josu San MartinJosu San MartinScore: 6,841Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 4, 2026 17:536,60684,702,90752,836,0001,993,0002,453,504
2Jan 4, 2026 17:536,78480,206,26855,306,0001,005,0002,285,568
3Jan 4, 2026 17:536,78977,390,11255,342,0001,006,0002,433,024
4Jan 4, 2026 17:536,84185,063,71355,788,000996,0002,285,568
5Jan 4, 2026 17:536,93684,144,83055,548,0002,019,0002,527,232
6Jan 4, 2026 17:536,96383,841,03055,802,0001,992,0002,445,312