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 20, 2026 09:40Victor MerckléVictor MerckléScore: 14,098Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 20, 2026 09:4113,989123,725,179115,088,0001,022,0002,113,536
2Jun 20, 2026 09:4114,014123,946,868115,291,0001,033,0002,113,536
3Jun 20, 2026 09:4114,026125,215,248115,385,0001,036,0002,113,536
4Jun 20, 2026 09:4114,082124,540,462115,854,0001,027,0002,113,536
5Jun 20, 2026 09:4114,098124,666,710116,008,0001,012,0002,113,536
6Jun 20, 2026 09:4114,121124,616,558116,169,0001,043,0002,113,536
7Jun 20, 2026 09:4114,127124,895,887116,250,0001,010,0002,113,536
8Jun 20, 2026 09:4114,215125,656,257116,925,0001,062,0002,113,536
9Jun 20, 2026 09:4114,233125,800,818117,065,0001,069,0002,113,536