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 8, 2026 11:41Victor MerckléVictor MerckléScore: 4,111Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2026 11:424,09142,083,50632,859,0001,103,0002,117,632stderr
2Jul 8, 2026 11:424,09142,372,16032,819,0001,138,0002,117,632stderr
3Jul 8, 2026 11:424,09942,098,94932,926,0001,099,0002,117,632stderr
4Jul 8, 2026 11:424,11042,189,58233,073,0001,043,0002,117,632stderr
5Jul 8, 2026 11:424,11142,420,59833,085,0001,044,0002,117,632stderr
6Jul 8, 2026 11:424,11442,268,74433,077,0001,077,0002,117,632stderr
7Jul 8, 2026 11:424,11542,247,95233,128,0001,031,0002,117,632stderr
8Jul 8, 2026 11:424,11542,209,42133,132,0001,025,0002,117,632stderr
9Jul 8, 2026 11:424,12542,371,83233,201,0001,039,0002,117,632stderr