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 listNov 2, 2024 21:53zielajzielajScore: 16,861Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 2, 2024 21:5316,852167,974,753138,876,000999,0002,428,928
2Nov 2, 2024 21:5316,856162,907,097137,903,0001,998,0002,535,424
3Nov 2, 2024 21:5316,858162,547,818138,926,000999,0002,527,232
4Nov 2, 2024 21:5316,858161,068,409138,924,000999,0002,535,424
5Nov 2, 2024 21:5316,861164,092,620138,950,000999,0002,420,736
6Nov 2, 2024 21:5316,863162,092,734138,963,000999,0002,535,424
7Nov 2, 2024 21:5316,870168,716,364138,017,0002,000,0002,273,280
8Nov 2, 2024 21:5316,873166,336,975138,042,0002,000,0002,273,280
9Nov 2, 2024 21:5316,877164,440,859138,074,0002,001,0002,273,280