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:26Victor MerckléVictor MerckléScore: 4,208Success
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:274,19143,138,08533,778,0001,012,0002,117,632stderr
2Aug 25, 2026 14:274,19343,190,88533,735,0001,070,0002,117,632stderr
3Aug 25, 2026 14:274,19943,200,93033,831,0001,026,0002,117,632stderr
4Aug 25, 2026 14:274,20543,309,18233,702,0001,206,0002,117,632stderr
5Aug 25, 2026 14:274,20843,318,87433,909,0001,023,0002,117,632stderr
6Aug 25, 2026 14:274,24043,556,47134,179,0001,015,0002,117,632stderr
7Aug 25, 2026 14:274,24243,740,46334,189,0001,023,0002,117,632stderr
8Aug 25, 2026 14:274,24743,723,44834,240,0001,016,0002,117,632stderr
9Aug 25, 2026 14:274,38945,016,54935,391,0001,044,0002,117,632stderr