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 listJan 16, 2025 19:06ttmxttmxScore: 90,057Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 16, 2025 19:0690,031775,979,459746,256,0001,000,0002,289,664
2Jan 16, 2025 19:0690,040776,873,109747,328,00002,289,664
3Jan 16, 2025 19:0690,042775,823,976746,348,0001,000,0002,281,472
4Jan 16, 2025 19:0690,057774,023,206745,475,0001,998,0002,273,280
5Jan 16, 2025 19:0690,057773,727,934745,473,0001,998,0002,273,280
6Jan 16, 2025 19:0690,073772,882,627744,606,0002,998,0002,289,664
7Jan 16, 2025 19:0690,090771,513,361745,745,0001,999,0002,289,664
8Jan 16, 2025 19:0690,120773,988,294745,994,0001,999,0002,289,664
9Jan 16, 2025 19:0690,122773,889,116746,010,0002,000,0002,523,136