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 11:06Victor MerckléVictor MerckléScore: 3,817Success
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 11:063,78040,107,02230,264,0001,117,0002,117,632stderr
2Aug 25, 2026 11:063,80540,028,88430,445,0001,139,0002,117,632stderr
3Aug 25, 2026 11:063,81440,031,90730,514,0001,143,0002,117,632stderr
4Aug 25, 2026 11:063,81540,047,17930,596,0001,069,0002,117,632stderr
5Aug 25, 2026 11:063,81740,098,47930,520,0001,169,0002,117,632stderr
6Aug 25, 2026 11:063,81740,009,81030,583,0001,105,0002,117,632stderr
7Aug 25, 2026 11:063,82040,110,66430,636,0001,074,0002,117,632stderr
8Aug 25, 2026 11:063,84440,295,62730,806,0001,103,0002,117,632stderr
9Aug 25, 2026 11:064,01141,686,04832,244,0001,052,0002,117,632stderr