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 21:55Valentin KofmanValentin KofmanScore: 57,472Success
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 21:5557,423503,973,107474,616,0001,998,0002,269,184
2Jun 21, 2025 21:5557,472499,389,943474,018,0003,000,0002,404,352
3Jun 21, 2025 21:5557,477500,854,351476,059,0001,000,0002,408,448