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 11, 2026 14:48Victor MerckléVictor MerckléScore: 3,969Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 11, 2026 14:493,93841,074,43331,649,0001,038,0002,117,632stderr
2Aug 11, 2026 14:493,94241,120,37031,699,0001,023,0002,117,632stderr
3Aug 11, 2026 14:493,96641,323,53131,910,0001,010,0002,117,632stderr
4Aug 11, 2026 14:493,96841,368,54831,819,0001,118,0002,117,632stderr
5Aug 11, 2026 14:493,96941,319,97431,767,0001,183,0002,117,632stderr
6Aug 11, 2026 14:493,98641,303,96932,048,0001,038,0002,117,632stderr
7Aug 11, 2026 14:493,99441,537,38032,027,0001,130,0002,117,632stderr
8Aug 11, 2026 14:494,14942,681,15233,241,0001,196,0002,117,632stderr
9Aug 11, 2026 14:494,20843,361,10333,897,0001,031,0002,117,632stderr