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 21, 2025 22:07Valentin KofmanValentin KofmanScore: 58,338Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 21, 2025 22:0758,266517,894,434482,606,000999,0002,281,472
2Jun 21, 2025 22:0758,338506,656,095483,203,0001,000,0002,289,664
3Jun 21, 2025 22:0758,338509,058,204483,207,0001,000,0002,289,664