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 listFeb 2, 2026 22:38javivallejojavivallejoScore: 39,184Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 2, 2026 22:3839,167355,096,764323,086,0002,000,0002,289,664
2Feb 2, 2026 22:3839,170357,091,784323,107,0002,000,0002,289,664
3Feb 2, 2026 22:3839,180348,572,994325,196,00002,265,088
4Feb 2, 2026 22:3839,181353,229,361323,202,0002,001,0002,289,664
5Feb 2, 2026 22:3839,184348,142,356324,226,0001,000,0002,523,136
6Feb 2, 2026 22:3839,491358,477,210325,780,0001,998,0002,265,088
7Feb 2, 2026 22:3840,058357,391,971331,477,0001,001,0002,269,184
8Feb 2, 2026 22:3840,060364,269,706330,501,0001,996,0002,289,664
9Feb 2, 2026 22:3840,093362,161,851330,777,0001,998,0002,289,664