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 6, 2026 23:27Victor MerckléVictor MerckléScore: 4,801Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 23:284,79047,642,92938,650,0001,112,0002,117,632stderr
2Jul 6, 2026 23:284,79247,679,09438,625,0001,150,0002,117,632stderr
3Jul 6, 2026 23:284,79347,650,86638,697,0001,089,0002,117,632stderr
4Jul 6, 2026 23:284,79547,683,33738,691,0001,109,0002,117,632stderr
5Jul 6, 2026 23:284,80147,691,13938,741,0001,108,0002,117,632stderr
6Jul 6, 2026 23:284,80147,910,63638,745,0001,105,0002,117,632stderr
7Jul 6, 2026 23:284,80747,810,53238,887,0001,016,0002,117,632stderr
8Jul 6, 2026 23:284,81248,459,04738,921,0001,022,0002,117,632stderr
9Jul 6, 2026 23:284,82648,588,68339,051,0001,009,0002,117,632stderr