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 listJun 30, 2026 09:25Victor MerckléVictor MerckléScore: 4,361Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2026 09:264,35144,362,74435,029,0001,090,0002,117,632stderr
2Jun 30, 2026 09:264,35644,093,94335,070,0001,085,0002,117,632stderr
3Jun 30, 2026 09:264,36044,138,98835,077,0001,119,0002,117,632stderr
4Jun 30, 2026 09:264,36144,079,63335,091,0001,107,0002,117,632stderr
5Jun 30, 2026 09:264,36144,127,74035,185,0001,018,0002,117,632stderr
6Jun 30, 2026 09:264,36444,114,88635,211,0001,012,0002,117,632stderr
7Jun 30, 2026 09:264,36844,136,56335,163,0001,098,0002,117,632stderr
8Jun 30, 2026 09:264,37044,165,14435,239,0001,032,0002,117,632stderr
9Jun 30, 2026 09:264,39244,399,19935,453,0001,007,0002,117,632stderr