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 listSep 17, 2025 20:06sheryllynn24sheryllynn24Score: 18,841Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 17, 2025 20:0618,828182,264,069155,274,0001,001,0002,285,568
2Sep 17, 2025 20:0618,832184,558,247154,300,0002,003,0002,277,376
3Sep 17, 2025 20:0618,833184,550,642153,311,0003,006,0002,277,376
4Sep 17, 2025 20:0618,837181,568,514153,340,0003,006,0002,510,848
5Sep 17, 2025 20:0618,841189,435,700155,376,0001,002,0002,510,848
6Sep 17, 2025 20:0618,856185,119,904154,498,0002,006,0002,277,376
7Sep 17, 2025 20:0618,862181,487,677154,564,0001,994,0002,273,280
8Sep 17, 2025 20:0618,895186,271,218154,832,0001,997,0002,510,848
9Sep 17, 2025 20:0619,010189,011,324156,783,000998,0002,506,752