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 15:02Victor MerckléVictor MerckléScore: 6,700Success
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 15:036,69663,177,40954,501,0001,084,0002,113,536
2Jun 10, 2026 15:036,69763,512,29454,480,0001,112,0002,113,536
3Jun 10, 2026 15:036,69863,218,60154,528,0001,073,0002,113,536
4Jun 10, 2026 15:036,69963,230,64454,513,0001,091,0002,113,536
5Jun 10, 2026 15:036,70062,993,98654,541,0001,076,0002,113,536
6Jun 10, 2026 15:036,70163,248,11054,536,0001,084,0002,113,536
7Jun 10, 2026 15:036,70363,359,51254,501,0001,138,0002,113,536
8Jun 10, 2026 15:036,70563,549,59254,561,0001,098,0002,113,536
9Jun 10, 2026 15:036,70763,321,29254,581,0001,091,0002,113,536