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 listAug 25, 2026 14:08Victor MerckléVictor MerckléScore: 3,954Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 25, 2026 14:093,92940,993,33631,556,0001,056,0002,117,632stderr
2Aug 25, 2026 14:093,94647,310,49431,623,0001,130,0002,117,632stderr
3Aug 25, 2026 14:093,94941,230,15631,687,0001,092,0002,117,632stderr
4Aug 25, 2026 14:093,95141,168,69831,753,0001,046,0002,117,632stderr
5Aug 25, 2026 14:093,95441,239,21531,666,0001,157,0002,117,632stderr
6Aug 25, 2026 14:094,06042,105,34032,572,0001,126,0002,117,632stderr
7Aug 25, 2026 14:094,07842,969,41032,803,0001,047,0002,117,632stderr
8Aug 25, 2026 14:094,11242,494,83033,084,0001,049,0002,117,632stderr
9Aug 25, 2026 14:094,24843,663,94134,104,0001,159,0002,117,632stderr