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 listJul 15, 2025 20:42Safronov AlekseiSafronov AlekseiScore: 50,182Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 15, 2025 20:4250,156439,814,432414,295,0002,001,0002,269,184
2Jul 15, 2025 20:4250,159438,999,216414,315,0002,001,0002,277,376
3Jul 15, 2025 20:4250,170438,772,944416,411,00002,273,280
4Jul 15, 2025 20:4250,182446,864,976415,510,0001,001,0002,269,184
5Jul 15, 2025 20:4250,182446,793,214413,509,0003,003,0002,277,376
6Jul 15, 2025 20:4250,182443,273,507414,510,0002,002,0002,277,376
7Jul 15, 2025 20:4250,199448,856,634412,657,0003,996,0002,277,376
8Jul 15, 2025 20:4250,201445,985,252414,668,0001,998,0002,265,088
9Jul 15, 2025 20:4250,206438,941,980413,710,0002,997,0002,277,376