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 24, 2026 18:26Victor MerckléVictor MerckléScore: 12,274Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 18:2612,027107,518,10898,788,0001,042,0002,117,632stderr
2Jun 24, 2026 18:2612,056108,203,33298,948,0001,120,0002,117,632stderr
3Jun 24, 2026 18:2612,102108,482,91599,426,0001,027,0002,117,632stderr
4Jun 24, 2026 18:2612,106108,152,19199,459,0001,025,0002,117,632stderr
5Jun 24, 2026 18:2612,274109,687,382100,736,0001,140,0002,117,632stderr
6Jun 24, 2026 18:2612,283109,634,924100,899,0001,058,0002,117,632stderr
7Jun 24, 2026 18:2612,294109,699,359100,907,0001,140,0002,117,632stderr
8Jun 24, 2026 18:2612,323109,924,200101,166,0001,115,0002,117,632stderr
9Jun 24, 2026 18:2612,487111,280,372102,620,0001,025,0002,117,632stderr