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 listSep 5, 2024 10:27Matthew BookerMatthew BookerScore: 1,826,147Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 5, 2024 10:271,815,05115,100,385,38714,986,964,00077,963,0002,281,472
2Sep 5, 2024 10:271,824,52815,175,566,64315,087,611,00055,972,0002,281,472
3Sep 5, 2024 10:271,824,73615,173,928,10915,073,335,00071,972,0002,281,472
4Sep 5, 2024 10:271,824,99115,179,287,53115,089,451,00057,971,0002,289,664
5Sep 5, 2024 10:271,826,14715,184,984,20215,095,045,00061,971,0002,523,136
6Sep 5, 2024 10:271,827,23015,198,954,66815,093,041,00072,971,0002,281,472
7Sep 5, 2024 10:271,829,37015,211,994,45815,102,808,00080,966,0002,281,472
8Sep 5, 2024 10:271,829,83215,221,014,75815,131,630,00055,976,0002,289,664
9Sep 5, 2024 10:271,831,74115,237,686,26215,142,474,00060,977,0002,281,472