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 25, 2026 18:24Victor MerckléVictor MerckléScore: 4,246Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 25, 2026 18:254,23242,821,23834,022,0001,111,0002,113,536
2Jun 25, 2026 18:254,23242,716,24134,026,0001,105,0002,113,536
3Jun 25, 2026 18:254,23542,630,63834,046,0001,107,0002,113,536
4Jun 25, 2026 18:254,23842,776,25034,075,0001,102,0002,113,536
5Jun 25, 2026 18:254,24642,801,07734,143,0001,106,0002,113,536
6Jun 25, 2026 18:254,24742,833,15934,255,0001,003,0002,113,536
7Jun 25, 2026 18:254,25342,931,70934,225,0001,080,0002,113,536
8Jun 25, 2026 18:254,26443,047,10434,395,0001,001,0002,113,536
9Jun 25, 2026 18:254,29843,245,52534,602,0001,078,0002,113,536