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 12, 2025 12:30AdityaAdityaScore: 1,827,531Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 12, 2025 12:301,822,84615,163,977,64615,056,661,00072,964,0002,289,664
2Jan 12, 2025 12:301,823,88415,176,706,94815,066,274,00071,967,0002,277,376
3Jan 12, 2025 12:301,824,56515,176,463,85115,072,935,00070,952,0002,277,376
4Jan 12, 2025 12:301,825,34015,180,518,07515,075,360,00074,966,0002,277,376
5Jan 12, 2025 12:301,827,53115,199,361,86315,096,553,00071,954,0002,273,280
6Jan 12, 2025 12:301,829,01915,215,776,32015,110,892,00069,967,0002,289,664
7Jan 12, 2025 12:301,830,04615,221,817,86915,119,420,00069,960,0002,265,088
8Jan 12, 2025 12:301,830,77215,221,076,65415,127,440,00067,970,0002,277,376
9Jan 12, 2025 12:301,913,84215,919,115,07415,804,933,00079,954,0002,265,088