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 7, 2026 19:52Victor MerckléVictor MerckléScore: 47,213Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 19:5446,721396,342,258382,613,0005,174,0002,117,632stderr
2Sep 7, 2026 19:5446,859397,410,693384,513,0004,417,00024,576stderr
3Sep 7, 2026 19:5446,875397,541,012384,821,0004,243,0002,117,632stderr
4Sep 7, 2026 19:5446,981398,544,115385,908,0004,041,00024,576stderr
5Sep 7, 2026 19:5447,213401,056,110387,176,0004,693,00024,576stderr
6Sep 7, 2026 19:5447,331402,114,261388,441,0004,409,00024,576stderr
7Sep 7, 2026 19:5447,369401,828,148388,596,0004,567,00024,576stderr
8Sep 7, 2026 19:5447,419402,806,443388,692,0004,891,0002,117,632stderr
9Sep 7, 2026 19:5447,519403,619,664389,733,0004,678,00024,576stderr