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 listNov 14, 2024 22:39zielajzielajScore: 3,924Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 14, 2024 22:393,90254,611,05930,364,0002,024,0002,273,280
2Nov 14, 2024 22:393,91159,152,43932,458,00002,359,296
3Nov 14, 2024 22:393,91358,016,77231,465,0001,015,0002,535,424
4Nov 14, 2024 22:393,91551,853,28631,480,0001,015,0002,457,600
5Nov 14, 2024 22:393,92060,463,26131,517,0001,016,0002,535,424
6Nov 14, 2024 22:393,92359,063,19332,565,00002,277,376
7Nov 14, 2024 22:393,92461,138,18231,550,0001,017,0002,535,424
8Nov 14, 2024 22:393,92558,413,96932,575,00002,367,488
9Nov 14, 2024 22:393,92756,123,25632,593,00002,535,424
10Nov 14, 2024 22:393,95861,182,25832,850,00002,277,376
11Nov 14, 2024 22:393,95957,795,06731,865,000995,0002,371,584
12Nov 14, 2024 22:394,00754,044,81431,246,0002,015,0002,457,600