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 26, 2026 23:08Victor MerckléVictor MerckléScore: 23,152Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 26, 2026 23:0922,990199,228,480186,800,0004,022,0002,117,632stderr
2Aug 26, 2026 23:0923,045199,629,533187,236,0004,038,0002,117,632stderr
3Aug 26, 2026 23:0923,114200,790,883187,814,0004,036,0002,117,632stderr
4Aug 26, 2026 23:0923,137200,397,307186,951,0005,091,0002,117,632stderr
5Aug 26, 2026 23:0923,152200,511,704186,979,0005,184,0002,117,632stderr
6Aug 26, 2026 23:0923,162200,665,957187,123,0005,129,0002,117,632stderr
7Aug 26, 2026 23:0923,194200,871,009188,392,0004,125,0002,117,632stderr
8Aug 26, 2026 23:0923,343202,112,256189,668,0004,086,0002,117,632stderr
9Aug 26, 2026 23:0923,489203,954,883190,922,0004,041,0002,117,632stderr