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 2, 2026 10:15Victor MerckléVictor MerckléScore: 4,731Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2026 10:184,71047,056,75337,967,0001,129,0002,117,632stderr
2Jul 2, 2026 10:184,71247,036,21137,983,0001,130,0002,117,632stderr
3Jul 2, 2026 10:184,72346,923,04438,062,0001,147,0002,117,632stderr
4Jul 2, 2026 10:184,72847,138,31638,108,0001,135,0002,117,632stderr
5Jul 2, 2026 10:184,73146,964,46838,160,0001,113,0002,117,632stderr
6Jul 2, 2026 10:184,73447,217,63238,287,0001,011,0002,117,632stderr
7Jul 2, 2026 10:184,73647,381,69038,298,0001,013,0002,117,632stderr
8Jul 2, 2026 10:184,74347,318,57438,235,0001,133,0002,117,632stderr
9Jul 2, 2026 10:184,74547,280,10338,339,0001,051,0002,117,632stderr