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 11, 2025 17:02Advait IyerAdvait IyerScore: 66,429Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 11, 2025 17:0266,400583,480,294548,120,0003,000,0002,277,376
2Jan 11, 2025 17:0266,414578,462,785548,233,0003,001,0002,273,280
3Jan 11, 2025 17:0266,422577,654,537551,302,00002,277,376
4Jan 11, 2025 17:0266,427578,632,308549,344,0002,001,0002,277,376
5Jan 11, 2025 17:0266,429577,900,006549,356,0002,001,0002,277,376
6Jan 11, 2025 17:0266,432590,057,688550,391,000998,0002,277,376
7Jan 11, 2025 17:0266,440581,040,827550,450,0001,000,0002,277,376
8Jan 11, 2025 17:0266,453581,138,691550,562,000999,0002,363,392
9Jan 11, 2025 17:0266,468576,779,374549,683,0001,998,0002,277,376