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 listAug 6, 2025 02:47rockyou1337rockyou1337Score: 66,220Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 6, 2025 02:4766,126573,954,876543,846,0004,998,0002,277,376
2Aug 6, 2025 02:4766,189576,067,552548,365,0001,000,0002,277,376
3Aug 6, 2025 02:4766,207573,235,434547,524,0001,998,0002,498,560
4Aug 6, 2025 02:4766,217578,779,571546,603,0002,997,0002,277,376
5Aug 6, 2025 02:4766,220576,633,711547,626,0001,998,0002,289,664
6Aug 6, 2025 02:4766,222576,273,723547,648,0001,998,0002,289,664
7Aug 6, 2025 02:4766,231576,637,790547,722,0001,998,0002,510,848
8Aug 6, 2025 02:4766,242576,541,564547,809,0001,999,0002,502,656
9Aug 6, 2025 02:4766,254578,417,324547,913,0001,999,0002,277,376