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 listJun 27, 2026 10:44Victor MerckléVictor MerckléScore: 4,445Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 27, 2026 10:464,43445,705,20135,715,0001,088,0002,138,112
2Jun 27, 2026 10:464,43546,120,45735,724,0001,088,0002,138,112
3Jun 27, 2026 10:464,43946,454,13035,785,0001,062,0002,138,112
4Jun 27, 2026 10:464,44146,496,04735,779,0001,084,0002,138,112
5Jun 27, 2026 10:464,44546,260,45835,824,0001,071,0002,138,112
6Jun 27, 2026 10:464,44946,644,23935,853,0001,077,0002,138,112
7Jun 27, 2026 10:464,45146,288,84335,863,0001,081,0002,138,112
8Jun 27, 2026 10:464,46246,756,10435,985,0001,056,0002,138,112
9Jun 27, 2026 10:464,46346,673,63435,965,0001,079,0002,138,112