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 17, 2025 15:47ttmxttmxScore: 33,461Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 17, 2025 15:4733,441302,294,955276,562,0001,002,0002,289,664
2Jan 17, 2025 15:4733,443303,245,523276,578,0001,002,0002,289,664
3Jan 17, 2025 15:4733,449305,076,432276,631,000998,0002,273,280
4Jan 17, 2025 15:4733,459301,927,332276,715,000998,0002,289,664
5Jan 17, 2025 15:4733,461307,256,348275,728,0001,998,0002,523,136
6Jan 17, 2025 15:4733,464302,356,254275,750,0001,998,0002,289,664
7Jan 17, 2025 15:4733,481300,746,666275,892,0001,999,0002,289,664
8Jan 17, 2025 15:4733,485301,765,392276,928,000999,0002,289,664
9Jan 17, 2025 15:4733,512304,003,439276,147,0002,001,0002,289,664