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 listSep 27, 2025 07:24sheryllynn24sheryllynn24Score: 6,804Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 27, 2025 07:246,66484,012,91653,297,0002,011,0002,269,184
2Sep 27, 2025 07:246,66780,959,15053,325,0002,012,0002,289,664
3Sep 27, 2025 07:246,69683,714,19154,564,0001,010,0002,514,944
4Sep 27, 2025 07:246,80478,543,53155,467,0001,008,0002,265,088
5Sep 27, 2025 07:246,80978,848,80655,506,0001,009,0002,289,664
6Sep 27, 2025 07:246,81177,774,21356,533,00002,523,136