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 24, 2026 17:23Victor MerckléVictor MerckléScore: 3,775Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 24, 2026 17:263,70139,122,60929,595,0001,127,0002,117,632stderr
2Aug 24, 2026 17:263,73539,443,24129,906,0001,098,0002,117,632stderr
3Aug 24, 2026 17:263,74839,468,85830,015,0001,095,0002,117,632stderr
4Aug 24, 2026 17:263,75939,615,74030,028,0001,174,0002,117,632stderr
5Aug 24, 2026 17:263,77539,703,24130,266,0001,074,0002,117,632stderr
6Aug 24, 2026 17:263,79139,900,43630,356,0001,117,0002,117,632stderr
7Aug 24, 2026 17:263,80040,020,63230,417,0001,124,0002,117,632stderr
8Aug 24, 2026 17:263,86340,455,49230,940,0001,127,0002,117,632stderr
9Aug 24, 2026 17:264,02742,387,89432,339,0001,090,0002,117,632stderr