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 27, 2023 12:40unsatcoreunsatcoreScore: 12,608Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 27, 2023 12:4011,627167,269,64596,504,43002,273,280
2Jan 27, 2023 12:4011,643163,166,55196,633,79102,273,280
3Jan 27, 2023 12:4011,834156,727,65098,218,46402,248,704
4Jan 27, 2023 12:4012,582125,015,755103,430,0001,004,0002,260,992
5Jan 27, 2023 12:4012,594131,859,156103,522,0001,005,0002,269,184
6Jan 27, 2023 12:4012,602129,735,226103,589,0001,005,0002,531,328
7Jan 27, 2023 12:4012,608126,758,270103,652,000996,0002,260,992
8Jan 27, 2023 12:4012,626132,298,548103,796,000998,0002,523,136
9Jan 27, 2023 12:4012,657131,410,815102,051,0003,001,0002,265,088
10Jan 27, 2023 12:4012,689132,102,653103,316,0002,006,0002,531,328
11Jan 27, 2023 12:4012,715135,379,772103,527,0002,010,0002,269,184
12Jan 27, 2023 12:4012,959134,894,129104,542,0003,015,0002,527,232