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 14, 2026 17:45marko1597marko1597Score: 6,184Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 14, 2026 17:456,17861,224,75750,140,0001,141,0002,117,632stderr
2Aug 14, 2026 17:456,18061,325,49350,131,0001,164,0002,117,632stderr
3Aug 14, 2026 17:456,18061,294,72650,143,0001,154,0002,117,632stderr
4Aug 14, 2026 17:456,18361,479,65850,167,0001,157,0002,117,632stderr
5Aug 14, 2026 17:456,18461,299,89950,186,0001,143,0002,117,632stderr
6Aug 14, 2026 17:456,19061,377,49450,236,0001,149,0002,117,632stderr
7Aug 14, 2026 17:456,19961,516,08350,344,0001,109,0002,117,632stderr
8Aug 14, 2026 17:456,44563,497,88152,343,0001,153,0002,117,632stderr
9Aug 14, 2026 17:456,44663,499,36452,350,0001,154,0002,117,632stderr