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 11, 2026 01:14Victor MerckléVictor MerckléScore: 17,862Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 11, 2026 01:1517,848155,706,937147,100,0001,045,0002,113,536
2Jun 11, 2026 01:1517,850155,802,970147,104,0001,057,0002,113,536
3Jun 11, 2026 01:1517,856155,734,892147,153,0001,053,0002,113,536
4Jun 11, 2026 01:1517,858156,169,225147,152,0001,076,0002,113,536
5Jun 11, 2026 01:1517,862155,828,921147,191,0001,069,0002,113,536
6Jun 11, 2026 01:1517,863155,853,628147,179,0001,090,0002,113,536
7Jun 11, 2026 01:1517,863156,092,127147,149,0001,119,0002,113,536
8Jun 11, 2026 01:1517,864155,865,161147,177,0001,095,0002,113,536
9Jun 11, 2026 01:1517,871156,193,440147,238,0001,097,0002,113,536