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 26, 2026 03:13Victor MerckléVictor MerckléScore: 4,990Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 26, 2026 03:134,95849,614,39540,103,0001,049,0002,117,632stderr
2Aug 26, 2026 03:134,97149,696,69840,149,0001,114,0002,117,632stderr
3Aug 26, 2026 03:134,98449,735,08940,281,0001,090,0002,117,632stderr
4Aug 26, 2026 03:134,98949,864,04440,314,0001,099,0002,117,632stderr
5Aug 26, 2026 03:134,99049,797,01140,413,0001,012,0002,117,632stderr
6Aug 26, 2026 03:134,99249,793,34640,423,0001,018,0002,117,632stderr
7Aug 26, 2026 03:134,99449,848,67040,448,0001,007,0002,117,632stderr
8Aug 26, 2026 03:135,00649,939,60940,535,0001,023,0002,117,632stderr
9Aug 26, 2026 03:135,02950,128,95440,729,0001,013,0002,117,632stderr