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 02:55zielajzielajScore: 3,682Success
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 02:553,53453,409,53728,325,0001,011,0002,514,944
2Nov 19, 2024 02:553,54854,012,00529,452,00002,342,912
3Nov 19, 2024 02:553,55054,197,00929,467,00002,342,912
4Nov 19, 2024 02:553,56354,909,38029,571,00002,342,912
5Nov 19, 2024 02:553,58552,683,45027,772,0001,983,0002,355,200
6Nov 19, 2024 02:553,59553,146,70929,837,00002,523,136
7Nov 19, 2024 02:553,68255,336,46130,560,00002,359,296
8Nov 19, 2024 02:553,71559,161,52029,838,000994,0002,351,104
9Nov 19, 2024 02:553,71955,303,80129,871,000995,0002,269,184
10Nov 19, 2024 02:553,72152,873,69830,883,00002,363,392
11Nov 19, 2024 02:553,72654,631,85129,928,000997,0002,531,328
12Nov 19, 2024 02:553,74055,484,97830,044,0001,001,0002,527,232