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 listApr 22, 2026 09:47wnwnScore: 4,372Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 22, 2026 09:474,25055,651,47234,272,0001,008,0002,486,272
2Apr 22, 2026 09:474,25156,052,48834,278,0001,008,0002,478,080
3Apr 22, 2026 09:474,32955,655,22633,938,0001,996,0002,482,176
4Apr 22, 2026 09:474,35955,279,28836,183,00002,490,368
5Apr 22, 2026 09:474,37252,569,56035,280,0001,008,0002,482,176
6Apr 22, 2026 09:474,37554,187,61235,310,0001,008,0002,478,080
7Apr 22, 2026 09:474,38852,699,81435,417,0001,011,0002,490,368
8Apr 22, 2026 09:474,41152,114,66035,600,0001,017,0002,494,464
9Apr 22, 2026 09:474,45252,597,90034,962,0001,997,0002,486,272