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 10, 2026 23:51Victor MerckléVictor MerckléScore: 3,942Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 10, 2026 23:523,92240,994,97431,372,0001,183,0002,117,632stderr
2Aug 10, 2026 23:523,92340,957,40131,433,0001,128,0002,117,632stderr
3Aug 10, 2026 23:523,92341,643,54831,384,0001,177,0002,117,632stderr
4Aug 10, 2026 23:523,92540,969,57531,465,0001,118,0002,117,632stderr
5Aug 10, 2026 23:523,94241,849,79231,497,0001,227,0002,117,632stderr
6Aug 10, 2026 23:523,95641,333,63231,823,0001,018,0002,117,632stderr
7Aug 10, 2026 23:523,96441,338,30631,892,0001,016,0002,117,632stderr
8Aug 10, 2026 23:524,18543,766,41633,639,0001,104,0002,117,632stderr
9Aug 10, 2026 23:524,18643,166,91133,644,0001,103,0002,117,632stderr