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 25, 2025 20:34Adam FolwarcznyAdam FolwarcznyScore: 12,551Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 25, 2025 20:3412,550132,694,977103,162,0001,001,0002,523,136
2Aug 25, 2025 20:3412,550131,280,309101,157,0003,004,0002,379,776
3Aug 25, 2025 20:3412,550124,958,112102,165,0002,003,0002,445,312
4Aug 25, 2025 20:3412,551125,995,119102,168,0002,003,0002,437,120
5Aug 25, 2025 20:3412,551129,930,248101,167,0003,004,0002,400,256
6Aug 25, 2025 20:3412,556131,169,186101,211,0003,006,0002,539,520
7Aug 25, 2025 20:3412,564128,763,328102,276,0002,005,0002,400,256
8Aug 25, 2025 20:3412,568128,066,135103,310,0001,003,0002,310,144
9Aug 25, 2025 20:3412,596131,148,536102,535,0002,010,0002,437,120