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 18, 2024 01:29zielajzielajScore: 3,762Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 18, 2024 01:293,52854,607,62527,263,0002,019,0002,523,136
2Nov 18, 2024 01:303,52955,979,82027,274,0002,020,0002,523,136
3Nov 18, 2024 01:303,53353,101,18728,313,0001,011,0002,527,232
4Nov 18, 2024 01:293,53654,005,55528,335,0001,011,0002,527,232
5Nov 18, 2024 01:293,53750,541,80029,359,00002,523,136
6Nov 18, 2024 01:303,54851,690,79029,450,00002,334,720
7Nov 18, 2024 01:293,76252,576,60930,221,0001,007,0002,277,376
8Nov 18, 2024 01:303,76853,403,57429,259,0002,017,0002,531,328
9Nov 18, 2024 01:303,77361,420,08730,306,0001,010,0002,347,008
10Nov 18, 2024 01:303,77554,534,80630,325,0001,010,0002,531,328
11Nov 18, 2024 01:293,78556,315,38631,413,00002,355,200
12Nov 18, 2024 01:293,79350,885,23930,464,0001,015,0002,273,280