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 22, 2025 20:40Adam FolwarcznyAdam FolwarcznyScore: 18,806Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 22, 2025 20:3918,792178,061,470154,976,000999,0002,531,328
2Aug 22, 2025 20:4018,793182,596,731154,981,000999,0002,420,736
3Aug 22, 2025 20:3918,797183,329,724155,016,0001,000,0002,433,024
4Aug 22, 2025 20:4018,806177,284,116155,087,0001,000,0002,424,832
5Aug 22, 2025 20:4018,806178,509,365155,091,0001,000,0002,269,184
6Aug 22, 2025 20:3918,812177,877,274155,137,0001,000,0002,510,848