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 listOct 24, 2025 06:40Rashin SergeyRashin SergeyScore: 61,280Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 24, 2025 06:4061,173536,490,601505,738,0001,998,0002,273,280
2Oct 24, 2025 06:4061,205534,037,762506,003,0002,000,0002,273,280
3Oct 24, 2025 06:4061,245537,089,799506,337,0001,997,0002,265,088
4Oct 24, 2025 06:4061,251546,440,265507,386,0001,000,0002,273,280
5Oct 24, 2025 06:4061,280534,752,920506,626,0001,998,0002,269,184
6Oct 24, 2025 06:4061,353540,732,198505,232,0004,001,0002,273,280
7Oct 24, 2025 06:4061,901544,087,561507,781,0005,997,0002,273,280
8Oct 24, 2025 06:4061,920544,174,106505,937,0007,999,0002,273,280
9Oct 24, 2025 06:4062,406544,595,512506,972,00010,999,0002,260,992