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 16, 2025 23:15Ashish AhujaAshish AhujaScore: 15,251Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 16, 2025 23:1514,962155,632,540111,168,00013,019,0002,371,584
2Aug 16, 2025 23:1515,064156,874,357115,029,00010,002,0002,433,024
3Aug 16, 2025 23:1515,169151,460,656113,913,00011,990,0002,433,024
4Aug 16, 2025 23:1515,242156,483,803111,568,00014,942,0002,428,928
5Aug 16, 2025 23:1515,251152,228,237112,631,00013,954,0002,277,376
6Aug 16, 2025 23:1515,306152,774,025114,038,00013,004,0002,285,568
7Aug 16, 2025 23:1515,310156,606,013113,069,00014,008,0002,416,640
8Aug 16, 2025 23:1515,781156,930,291116,985,00013,998,0002,424,832
9Aug 16, 2025 23:1515,948162,344,426117,443,00014,929,0002,412,544