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 17, 2026 09:23Serge SmirnovSerge SmirnovScore: 28,817Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 17, 2026 09:2328,796248,257,114237,857,0001,158,0002,113,536
2Jun 17, 2026 09:2328,807248,335,088237,888,0001,215,0002,113,536
3Jun 17, 2026 09:2328,814248,419,668237,937,0001,223,0002,113,536
4Jun 17, 2026 09:2328,816248,786,559237,952,0001,224,0002,113,536
5Jun 17, 2026 09:2328,817249,142,329237,944,0001,238,0002,113,536
6Jun 17, 2026 09:2328,817248,807,007237,946,0001,237,0002,113,536
7Jun 17, 2026 09:2328,818248,463,676237,965,0001,225,0002,113,536
8Jun 17, 2026 09:2328,820248,602,466238,208,0001,005,0002,113,536
9Jun 17, 2026 09:2328,822248,547,178238,226,0001,003,0002,113,536