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 10, 2026 17:59Victor MerckléVictor MerckléScore: 3,925Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 10, 2026 17:593,91340,881,86431,264,0001,217,0002,117,632stderr
2Aug 10, 2026 17:593,91541,573,39431,258,0001,239,0002,117,632stderr
3Aug 10, 2026 17:593,91640,867,56631,337,0001,172,0002,117,632stderr
4Aug 10, 2026 17:593,92241,028,47331,312,0001,247,0002,117,632stderr
5Aug 10, 2026 17:593,92541,624,22531,353,0001,228,0002,117,632stderr
6Aug 10, 2026 17:593,93240,789,06431,617,0001,020,0002,117,632stderr
7Aug 10, 2026 17:593,94340,890,29731,499,0001,228,0002,117,632stderr
8Aug 10, 2026 17:593,94641,091,31131,598,0001,161,0002,117,632stderr
9Aug 10, 2026 17:593,94942,367,02131,605,0001,178,0002,117,632stderr