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 19, 2024 01:52zielajzielajScore: 3,677Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 19, 2024 01:223,52154,305,12328,221,0001,007,0002,523,136
2Nov 19, 2024 01:523,52455,274,98527,235,0002,017,0002,367,488
3Nov 19, 2024 01:523,52861,279,53928,272,0001,009,0002,371,584
4Nov 19, 2024 01:223,53251,467,95329,317,00002,363,392
5Nov 19, 2024 01:523,53350,559,23228,314,0001,011,0002,523,136
6Nov 19, 2024 01:223,54347,881,96129,405,00002,367,488
7Nov 19, 2024 01:523,67750,926,52130,516,00002,531,328
8Nov 19, 2024 01:223,69253,368,80430,644,00002,269,184
9Nov 19, 2024 01:223,71055,615,36528,808,0001,986,0002,383,872
10Nov 19, 2024 01:523,71355,184,76629,826,000994,0002,523,136
11Nov 19, 2024 01:523,73853,036,69029,026,0002,001,0002,383,872
12Nov 19, 2024 01:223,82151,343,82031,712,00002,367,488