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 10, 2026 11:26Victor MerckléVictor MerckléScore: 4,725Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 10, 2026 11:274,50345,033,37036,302,0001,073,0002,113,536
2Jun 10, 2026 11:274,50444,984,81536,314,0001,075,0002,113,536
3Jun 10, 2026 11:274,50944,847,73636,333,0001,097,0002,113,536
4Jun 10, 2026 11:274,53446,407,76036,574,0001,063,0002,113,536
5Jun 10, 2026 11:274,72546,795,71738,152,0001,067,0002,113,536
6Jun 10, 2026 11:274,73546,916,62338,239,0001,066,0002,113,536
7Jun 10, 2026 11:274,74346,964,75738,333,0001,034,0002,113,536
8Jun 10, 2026 11:274,76147,177,06238,502,0001,016,0002,113,536
9Jun 10, 2026 11:274,76747,111,92038,546,0001,025,0002,113,536