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 21:05Adam FolwarcznyAdam FolwarcznyScore: 10,441Success
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 21:0510,169115,096,75950,643,00033,762,0002,498,560
2Aug 30, 2025 21:0510,222111,333,78547,356,00037,490,0002,375,680
3Aug 30, 2025 21:0510,363109,222,99955,711,00030,299,0002,326,528
4Aug 30, 2025 21:0510,441112,228,78353,176,00033,481,0002,502,656
5Aug 30, 2025 21:0510,460114,719,20948,342,00038,476,0002,428,928
6Aug 30, 2025 21:0510,693128,353,69250,292,00038,458,0002,490,368