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 9, 2026 09:57Victor MerckléVictor MerckléScore: 25,729Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 9, 2026 09:5823,900206,530,683197,173,0001,203,0002,117,632stderr
2Jul 9, 2026 09:5825,536220,160,469210,865,0001,085,0002,117,632stderr
3Jul 9, 2026 09:5825,546220,400,319211,030,0001,005,0002,117,632stderr
4Jul 9, 2026 09:5825,680221,393,374212,145,0001,002,0002,117,632stderr
5Jul 9, 2026 09:5825,729221,740,544212,345,0001,206,0002,117,632stderr
6Jul 9, 2026 09:5825,766222,101,183212,644,0001,222,0002,117,632stderr
7Jul 9, 2026 09:5825,786222,273,722212,993,0001,033,0002,117,632stderr
8Jul 9, 2026 09:5825,795222,282,920212,876,0001,224,0002,117,632stderr
9Jul 9, 2026 09:5825,897222,881,073213,672,0001,274,0002,117,632stderr