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 20, 2025 17:57Adam FolwarcznyAdam FolwarcznyScore: 31,396Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 20, 2025 17:5731,227282,707,723258,184,0001,000,0002,531,328
2Aug 20, 2025 17:5731,385291,086,000259,493,0001,001,0002,523,136
3Aug 20, 2025 17:5731,390290,131,413259,537,0001,002,0002,441,216
4Aug 20, 2025 17:5731,392282,070,623259,548,0001,002,0002,445,312
5Aug 20, 2025 17:5731,396282,489,597258,589,0001,996,0002,441,216
6Aug 20, 2025 17:5731,771288,823,498261,703,0001,997,0002,531,328
7Aug 20, 2025 17:5731,773291,166,921262,717,0001,002,0002,531,328
8Aug 20, 2025 17:5731,775289,063,416261,738,0001,998,0002,531,328
9Aug 20, 2025 17:5731,776292,979,712261,742,0001,998,0002,437,120