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 10:16Victor MerckléVictor MerckléScore: 44,210Success
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 10:1644,089374,989,744364,915,0001,024,0002,117,632stderr
2Aug 10, 2026 10:1644,156375,565,450365,328,0001,171,0002,117,632stderr
3Aug 10, 2026 10:1644,188375,782,328365,752,0001,014,0002,117,632stderr
4Aug 10, 2026 10:1644,201376,015,892365,864,0001,012,0002,117,632stderr
5Aug 10, 2026 10:1644,210375,951,769365,944,0001,004,0002,117,632stderr
6Aug 10, 2026 10:1644,228376,287,844366,083,0001,014,0002,117,632stderr
7Aug 10, 2026 10:1644,286376,713,156366,547,0001,032,0002,117,632stderr
8Aug 10, 2026 10:1644,303376,889,358366,690,0001,032,0002,117,632stderr
9Aug 10, 2026 10:1644,325377,106,772366,875,0001,028,0002,117,632stderr