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 22:50Victor MerckléVictor MerckléScore: 4,644Success
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 22:514,58246,405,94936,937,0001,100,0002,117,632stderr
2Aug 25, 2026 22:514,58646,458,51437,059,0001,012,0002,117,632stderr
3Aug 25, 2026 22:514,59046,513,73237,031,0001,069,0002,117,632stderr
4Aug 25, 2026 22:514,62946,810,00437,316,0001,105,0002,117,632stderr
5Aug 25, 2026 22:514,64446,986,42737,516,0001,032,0002,117,632stderr
6Aug 25, 2026 22:514,65547,018,32837,609,0001,028,0002,117,632stderr
7Aug 25, 2026 22:514,65847,069,98837,639,0001,030,0002,117,632stderr
8Aug 25, 2026 22:514,68947,318,52537,802,0001,118,0002,117,632stderr
9Aug 25, 2026 22:514,89649,098,75539,609,0001,036,0002,117,632stderr