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 listSep 14, 2026 20:21Victor MerckléVictor MerckléScore: 4,070Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 14, 2026 20:224,05843,568,55832,624,0001,064,0002,117,632stderr
2Sep 14, 2026 20:224,06443,438,17432,680,0001,054,0002,117,632stderr
3Sep 14, 2026 20:224,06444,174,91432,679,0001,059,0002,117,632stderr
4Sep 14, 2026 20:224,06944,155,38832,718,0001,062,0002,117,632stderr
5Sep 14, 2026 20:224,07043,608,91532,718,0001,067,0002,117,632stderr
6Sep 14, 2026 20:224,07843,454,06932,781,0001,067,0002,117,632stderr
7Sep 14, 2026 20:224,11443,923,20733,088,0001,060,0002,117,632stderr
8Sep 14, 2026 20:224,14944,218,96833,353,0001,084,0002,117,632stderr
9Sep 14, 2026 20:224,16844,384,34833,548,0001,052,0002,117,632stderr