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 28, 2026 20:12Victor MerckléVictor MerckléScore: 4,916Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2026 20:134,86349,436,69139,345,0001,021,0002,117,632stderr
2Aug 28, 2026 20:134,86449,391,37839,352,0001,024,0002,117,632stderr
3Aug 28, 2026 20:134,88449,413,70539,519,0001,020,0002,117,632stderr
4Aug 28, 2026 20:134,91249,860,51939,735,0001,035,0002,117,632stderr
5Aug 28, 2026 20:134,91649,847,30639,782,0001,021,0002,117,632stderr
6Aug 28, 2026 20:134,92350,078,60139,824,0001,043,0002,117,632stderr
7Aug 28, 2026 20:134,93750,009,38839,936,0001,042,0002,117,632stderr
8Aug 28, 2026 20:134,94350,113,68740,008,0001,020,0002,117,632stderr
9Aug 28, 2026 20:134,96850,275,05740,211,0001,029,0002,117,632stderr