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:58Safronov AlekseiSafronov AlekseiScore: 50,407Success
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:5850,352440,620,467416,921,000999,0002,273,280
2Jun 21, 2025 21:5850,369443,610,271415,066,0003,000,0002,273,280
3Jun 21, 2025 21:5850,371444,053,229416,077,0002,000,0002,289,664
4Jun 21, 2025 21:5850,389440,225,325417,225,0001,000,0002,277,376
5Jun 21, 2025 21:5850,407450,113,747418,376,00002,281,472
6Jun 21, 2025 21:5850,443443,135,466417,672,0001,001,0002,289,664
7Jun 21, 2025 21:5850,449445,016,376415,725,0002,998,0002,281,472
8Jun 21, 2025 21:5850,463444,959,104415,841,0002,998,0002,273,280
9Jun 21, 2025 21:5850,484441,020,412417,016,0002,000,0002,273,280