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 listJun 22, 2025 16:10DuskyElfDuskyElfScore: 2,066,698Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 22, 2025 16:102,065,30717,170,536,29517,078,078,00063,974,0002,277,376
2Jun 22, 2025 16:102,065,55817,179,679,50817,081,161,00062,971,0002,519,040
3Jun 22, 2025 16:102,065,70717,175,592,30817,070,399,00074,966,0002,289,664
4Jun 22, 2025 16:102,066,61017,183,214,78217,070,902,00081,961,0002,285,568
5Jun 22, 2025 16:102,066,69817,188,821,22317,088,619,00064,971,0002,277,376
6Jun 22, 2025 16:102,067,47217,191,532,99217,086,045,00073,969,0002,285,568
7Jun 22, 2025 16:102,071,89917,233,302,97317,117,798,00078,962,0002,277,376
8Jun 22, 2025 16:102,073,50617,241,072,99017,146,125,00063,974,0002,289,664
9Jun 22, 2025 16:102,078,55417,291,019,49617,181,028,00070,967,0002,277,376