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 15:12Victor MerckléVictor MerckléScore: 47,110Success
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 15:1347,092399,196,096389,787,0001,084,0002,117,632stderr
2Aug 25, 2026 15:1347,099399,233,278389,831,0001,092,0002,117,632stderr
3Aug 25, 2026 15:1347,105399,355,639389,891,0001,086,0002,117,632stderr
4Aug 25, 2026 15:1347,105399,338,675389,833,0001,140,0002,117,632stderr
5Aug 25, 2026 15:1347,110399,436,384390,013,0001,007,0002,117,632stderr
6Aug 25, 2026 15:1347,110399,410,636390,008,0001,010,0002,117,632stderr
7Aug 25, 2026 15:1347,113400,656,246389,967,0001,074,0002,117,632stderr
8Aug 25, 2026 15:1347,114399,403,644389,950,0001,098,0002,117,632stderr
9Aug 25, 2026 15:1347,126399,532,485390,064,0001,085,0002,117,632stderr