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 24, 2025 23:02Valentin KofmanValentin KofmanScore: 10,620Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2025 23:0210,437116,498,02685,619,0001,007,0002,265,088
2Jun 24, 2025 23:0210,456117,641,34885,790,000997,0002,289,664
3Jun 24, 2025 23:0210,591113,888,76585,905,0001,997,0002,277,376
4Jun 24, 2025 23:0210,620110,955,30386,139,0002,003,0002,260,992
5Jun 24, 2025 23:0210,632114,435,65486,244,0002,005,0002,260,992
6Jun 24, 2025 23:0210,648117,158,51787,374,0001,004,0002,260,992