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, 2022 00:30Yuriy LyfenkoYuriy LyfenkoScore: 29,745Success
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, 2022 00:3029,703274,226,147244,530,0002,004,0002,523,136
2Jan 17, 2022 00:3029,707273,059,391244,563,0002,004,0002,326,528
3Jan 17, 2022 00:3029,711304,730,227246,601,92402,220,032
4Jan 17, 2022 00:3029,713311,364,828246,614,00402,215,936
5Jan 17, 2022 00:3029,719316,412,488246,669,68002,207,744
6Jan 17, 2022 00:3029,730275,255,142244,764,0001,998,0002,326,528
7Jan 17, 2022 00:3029,745282,214,706245,880,0001,003,0002,322,432
8Jan 17, 2022 00:3029,746272,966,681242,895,0003,998,0002,519,040
9Jan 17, 2022 00:3029,748276,490,522245,906,000999,0002,318,336
10Jan 17, 2022 00:3029,748270,698,126244,913,0001,999,0002,519,040
11Jan 17, 2022 00:3029,751277,034,837243,935,0002,999,0002,527,232
12Jan 17, 2022 00:3029,762271,084,906245,028,0002,000,0002,527,232