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 21, 2026 10:58Victor MerckléVictor MerckléScore: 4,702Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 10:594,68348,821,22437,831,0001,042,0002,113,536
2May 21, 2026 10:594,68646,711,02937,851,0001,043,0002,113,536
3May 21, 2026 10:594,68948,458,72537,850,0001,076,0002,113,536
4May 21, 2026 10:594,69646,877,85237,926,0001,055,0002,113,536
5May 21, 2026 10:594,70249,032,73237,958,0001,070,0002,113,536
6May 21, 2026 10:594,70447,056,76937,999,0001,048,0002,113,536
7May 21, 2026 10:594,70848,427,66138,049,0001,033,0002,113,536
8May 21, 2026 10:594,72847,941,46038,177,0001,070,0002,113,536
9May 21, 2026 10:594,73847,176,52038,324,0001,003,0002,113,536