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 listNov 29, 2025 20:58Rajarshi BasuRajarshi BasuScore: 22,741Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 29, 2025 20:5822,621215,251,354186,760,000998,0002,289,664
2Nov 29, 2025 20:5822,624214,211,299186,781,000998,0002,367,488
3Nov 29, 2025 20:5822,624213,401,251185,785,0001,997,0002,289,664
4Nov 29, 2025 20:5822,673215,328,494186,187,0002,002,0002,273,280
5Nov 29, 2025 20:5822,741213,979,412187,753,000998,0002,289,664
6Nov 29, 2025 20:5822,773215,272,838187,013,0002,000,0002,519,040
7Nov 29, 2025 20:5822,788209,809,065187,142,0002,001,0002,277,376
8Nov 29, 2025 20:5822,892211,469,577189,007,0001,000,0002,289,664
9Nov 29, 2025 20:5825,475234,194,593210,443,0001,002,0002,273,280