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:55Adam FolwarcznyAdam FolwarcznyScore: 31,783Success
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:5531,396286,670,678259,583,0001,002,0002,375,680
2Aug 20, 2025 17:5531,409287,320,432259,700,000998,0002,523,136
3Aug 20, 2025 17:5531,411290,672,746258,717,0001,997,0002,260,992
4Aug 20, 2025 17:5531,413287,992,782259,730,000998,0002,260,992
5Aug 20, 2025 17:5531,783288,154,098261,799,0001,998,0002,387,968
6Aug 20, 2025 17:5531,784296,957,258261,812,0001,998,0002,260,992
7Aug 20, 2025 17:5531,790284,035,149261,861,0001,998,0002,383,872
8Aug 20, 2025 17:5531,790288,943,637261,863,0001,998,0002,387,968
9Aug 20, 2025 17:5531,792289,506,075262,876,000999,0002,383,872