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 26, 2026 05:05Victor MerckléVictor MerckléScore: 16,550Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 26, 2026 05:0716,438144,235,538135,279,0001,158,0002,117,632stderr
2Jun 26, 2026 05:0716,499144,408,641135,807,0001,142,0002,117,632stderr
3Jun 26, 2026 05:0716,514144,766,891136,025,0001,047,0002,117,632stderr
4Jun 26, 2026 05:0716,519144,766,576135,958,0001,156,0002,117,632stderr
5Jun 26, 2026 05:0716,550144,841,295136,250,0001,120,0002,117,632stderr
6Jun 26, 2026 05:0716,556145,474,502136,267,0001,155,0002,117,632stderr
7Jun 26, 2026 05:0716,557145,111,045136,261,0001,166,0002,117,632stderr
8Jun 26, 2026 05:0716,635145,753,752136,996,0001,082,0002,117,632stderr
9Jun 26, 2026 05:0716,892149,358,629139,191,0001,014,0002,117,632stderr