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 listAug 25, 2026 01:29Victor MerckléVictor MerckléScore: 7,049Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 25, 2026 01:306,99666,581,94456,934,0001,135,0002,117,632stderr
2Aug 25, 2026 01:307,00266,466,53256,990,0001,131,0002,117,632stderr
3Aug 25, 2026 01:307,01166,588,02657,058,0001,136,0002,117,632stderr
4Aug 25, 2026 01:307,04566,865,95757,345,0001,130,0002,117,632stderr
5Aug 25, 2026 01:307,04966,912,14757,397,0001,110,0002,117,632stderr
6Aug 25, 2026 01:307,06867,027,67557,575,0001,096,0002,117,632stderr
7Aug 25, 2026 01:307,07967,195,57457,602,0001,157,0002,117,632stderr
8Aug 25, 2026 01:307,27468,790,79559,291,0001,090,0002,117,632stderr
9Aug 25, 2026 01:307,32369,177,18059,776,0001,012,0002,117,632stderr