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:56Victor MerckléVictor MerckléScore: 4,419Success
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:574,32544,234,37134,674,0001,230,0002,117,632stderr
2Aug 24, 2026 17:574,34945,125,91334,985,0001,116,0002,117,632stderr
3Aug 24, 2026 17:574,35345,135,39335,015,0001,119,0002,117,632stderr
4Aug 24, 2026 17:574,40344,857,24935,484,0001,065,0002,117,632stderr
5Aug 24, 2026 17:574,41945,690,44635,388,0001,291,0002,117,632stderr
6Aug 24, 2026 17:574,46447,035,98035,943,0001,115,0002,117,632stderr
7Aug 24, 2026 17:574,88853,694,94839,388,0001,185,0002,117,632stderr
8Aug 24, 2026 17:574,96655,261,25139,160,0002,063,0002,117,632stderr
9Aug 24, 2026 17:575,20956,428,31842,076,0001,162,0002,117,632stderr