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 28, 2026 20:29Victor MerckléVictor MerckléScore: 4,793Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2026 20:294,76348,569,74938,514,0001,023,0002,117,632stderr
2Aug 28, 2026 20:294,77447,805,22938,587,0001,038,0002,117,632stderr
3Aug 28, 2026 20:294,77747,738,57038,609,0001,041,0002,117,632stderr
4Aug 28, 2026 20:294,78048,667,31638,657,0001,022,0002,117,632stderr
5Aug 28, 2026 20:294,79347,907,59038,737,0001,046,0002,117,632stderr
6Aug 28, 2026 20:294,79948,883,64438,803,0001,035,0002,117,632stderr
7Aug 28, 2026 20:294,81048,091,93338,879,0001,046,0002,117,632stderr
8Aug 28, 2026 20:294,85549,327,91139,271,0001,027,0002,117,632stderr
9Aug 28, 2026 20:294,89049,674,13039,566,0001,024,0002,117,632stderr