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 listOct 11, 2024 01:16Joad NacerJoad NacerError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 11, 2024 01:1600000Error: expected "53683317082557350 ", got "53683315768279121 "stderr
2Oct 11, 2024 01:1600000Error: expected "53691358147676072 ", got "53691365361331493 "stderr
3Oct 11, 2024 01:1600000Error: expected "53682593096127786 ", got "53682593383669023 "stderr
4Oct 11, 2024 01:165,03671,496,54839,808,0001,990,0002,334,720
5Oct 11, 2024 01:165,04173,040,50738,852,0002,988,0002,510,848
6Oct 11, 2024 01:165,04971,268,27139,911,0001,995,0002,334,720
7Oct 11, 2024 01:165,04967,113,02638,917,0002,993,0002,334,720
8Oct 11, 2024 01:165,05163,139,06338,932,0002,994,0002,510,848
9Oct 11, 2024 01:165,05364,421,07038,944,0002,995,0002,334,720
10Oct 11, 2024 01:165,05669,141,96239,964,0001,998,0002,510,848
11Oct 11, 2024 01:165,05964,679,32038,993,0002,999,0002,334,720
12Oct 11, 2024 01:165,06665,434,28141,045,0001,001,0002,514,944