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 18, 2026 22:02Victor MerckléVictor MerckléScore: 6,416Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 18, 2026 22:036,39560,502,34251,974,0001,109,0002,113,536
2Jun 18, 2026 22:036,39661,090,41551,989,0001,104,0002,113,536
3Jun 18, 2026 22:036,39960,734,38152,002,0001,114,0002,113,536
4Jun 18, 2026 22:036,40160,543,52452,018,0001,112,0002,113,536
5Jun 18, 2026 22:036,41660,807,76652,153,0001,103,0002,113,536
6Jun 18, 2026 22:036,41960,945,85852,182,0001,100,0002,113,536
7Jun 18, 2026 22:036,48761,291,50152,805,0001,038,0002,113,536
8Jun 18, 2026 22:036,76163,560,66855,093,0001,030,0002,113,536
9Jun 18, 2026 22:036,89364,932,76356,119,0001,097,0002,113,536