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 21, 2025 21:16Adam FolwarcznyAdam FolwarcznyScore: 17,339Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 21, 2025 21:1617,332164,969,138141,861,0001,998,0002,531,328
2Aug 21, 2025 21:1617,337167,586,199141,899,0001,998,0002,441,216
3Aug 21, 2025 21:1617,339164,856,968141,915,0001,998,0002,531,328
4Aug 21, 2025 21:1617,339163,958,366141,914,0001,998,0002,531,328
5Aug 21, 2025 21:1617,339169,076,892141,913,0001,998,0002,531,328
6Aug 21, 2025 21:1617,340169,958,052141,923,0001,998,0002,441,216
7Aug 21, 2025 21:1617,341165,150,366141,931,0001,999,0002,441,216
8Aug 21, 2025 21:1617,343169,646,570142,939,0001,006,0002,445,312
9Aug 21, 2025 21:1617,343167,490,596141,944,0001,999,0002,445,312