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 listJun 28, 2025 15:40Valentin KofmanValentin KofmanScore: 7,998Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 28, 2025 15:406,08974,251,21950,536,00002,277,376
2Jun 28, 2025 15:406,10577,278,45250,671,00002,289,664
3Jun 28, 2025 15:406,15573,134,88950,084,0001,001,0002,289,664
4Jun 28, 2025 15:407,99891,423,01664,374,0002,011,0002,269,184
5Jun 28, 2025 15:408,02493,618,84866,601,00002,265,088
6Jun 28, 2025 15:408,03191,782,47265,651,0001,010,0002,273,280