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 listSep 11, 2026 21:51Victor MerckléVictor MerckléScore: 10,193Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 11, 2026 21:5410,133102,755,44483,090,0001,014,0002,117,632stderr
2Sep 11, 2026 21:5410,153102,800,32583,262,0001,016,0002,117,632stderr
3Sep 11, 2026 21:5410,174103,080,70783,431,0001,016,0002,117,632stderr
4Sep 11, 2026 21:5410,182102,956,50783,494,0001,019,0002,117,632stderr
5Sep 11, 2026 21:5410,193103,760,58183,590,0001,014,0002,117,632stderr
6Sep 11, 2026 21:5410,194103,217,69883,599,0001,015,0002,117,632stderr
7Sep 11, 2026 21:5410,200103,379,59183,648,0001,012,0002,117,632stderr
8Sep 11, 2026 21:5410,204103,663,24783,683,0001,012,0002,117,632stderr
9Sep 11, 2026 21:5410,264104,400,78184,185,0001,013,0002,117,632stderr