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 25, 2026 16:36Victor MerckléVictor MerckléScore: 4,699Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 25, 2026 16:374,65446,133,92037,550,0001,080,0002,113,536
2Jun 25, 2026 16:374,66746,240,47837,625,0001,116,0002,113,536
3Jun 25, 2026 16:374,67046,380,91737,654,0001,108,0002,113,536
4Jun 25, 2026 16:374,68146,417,48437,847,0001,009,0002,113,536
5Jun 25, 2026 16:374,69946,545,53037,891,0001,114,0002,113,536
6Jun 25, 2026 16:374,70149,053,73137,872,0001,150,0002,113,536
7Jun 25, 2026 16:374,72446,742,52638,194,0001,017,0002,113,536
8Jun 25, 2026 16:374,81347,506,55838,861,0001,091,0002,113,536
9Jun 25, 2026 16:374,93148,568,06539,891,0001,040,0002,113,536