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 30, 2025 20:47Adam FolwarcznyAdam FolwarcznyScore: 10,349Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 30, 2025 20:4710,262118,637,75146,550,00038,627,0002,473,984
2Aug 30, 2025 20:4710,287112,524,15646,125,00039,255,0002,502,656
3Aug 30, 2025 20:4710,349117,150,31951,343,00034,557,0002,494,464
4Aug 30, 2025 20:4710,349110,477,35446,403,00039,492,0002,416,640
5Aug 30, 2025 20:4710,362119,358,50153,380,00032,621,0002,310,144
6Aug 30, 2025 20:4710,388113,414,56649,967,00036,251,0002,310,144