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 listMay 13, 2026 17:00Victor MerckléVictor MerckléScore: 7,705Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 17:017,69473,942,71162,858,0001,005,0002,113,536
2May 13, 2026 17:017,70372,774,41662,899,0001,042,0002,113,536
3May 13, 2026 17:017,70372,626,82562,931,0001,012,0002,113,536
4May 13, 2026 17:017,70473,977,78462,927,0001,019,0002,113,536
5May 13, 2026 17:017,70572,614,10062,942,0001,012,0002,113,536
6May 13, 2026 17:017,70973,385,71762,973,0001,013,0002,113,536
7May 13, 2026 17:017,71271,843,44262,963,0001,050,0002,113,536
8May 13, 2026 17:017,72071,556,13162,959,0001,117,0002,113,536
9May 13, 2026 17:017,75472,575,99663,316,0001,045,0002,113,536