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 15, 2026 08:24Victor MerckléVictor MerckléScore: 4,590Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 15, 2026 08:254,56245,237,56036,776,0001,092,0002,113,536
2Jun 15, 2026 08:254,56345,256,83336,774,0001,100,0002,113,536
3Jun 15, 2026 08:254,57045,311,87136,896,0001,043,0002,113,536
4Jun 15, 2026 08:254,58145,397,85736,945,0001,079,0002,113,536
5Jun 15, 2026 08:254,59045,562,92137,007,0001,098,0002,113,536
6Jun 15, 2026 08:254,62845,773,39437,334,0001,079,0002,113,536
7Jun 15, 2026 08:254,72246,567,85338,168,0001,025,0002,113,536
8Jun 15, 2026 08:254,76946,980,93438,484,0001,103,0002,113,536
9Jun 15, 2026 08:254,79147,207,79138,745,0001,024,0002,113,536