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 listJul 9, 2023 20:16sliceteamsliceteamScore: 23,109Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 9, 2023 20:1623,067213,294,615190,454,0001,002,0002,383,872
2Jul 9, 2023 20:1623,075216,030,503191,523,00002,519,040
3Jul 9, 2023 20:1623,082221,378,608190,581,0001,003,0002,260,992
4Jul 9, 2023 20:1623,086216,968,507190,611,0001,003,0002,506,752
5Jul 9, 2023 20:1623,106219,053,261189,783,0001,997,0002,260,992
6Jul 9, 2023 20:1623,107222,629,991190,788,000998,0002,260,992
7Jul 9, 2023 20:1623,109216,619,409189,806,0001,997,0002,387,968
8Jul 9, 2023 20:1623,110216,861,458189,812,0001,998,0002,260,992
9Jul 9, 2023 20:1623,111218,506,676189,825,0001,998,0002,523,136
10Jul 9, 2023 20:1623,630263,643,667196,131,15302,265,088
11Jul 9, 2023 20:1623,647258,097,512196,271,42902,260,992
12Jul 9, 2023 20:1623,667261,985,029196,435,24402,260,992