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 listFeb 3, 2024 20:54IgorIgorScore: 1,645,538Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 3, 2024 21:121,644,42713,712,906,52913,648,744,24902,260,992
2Feb 3, 2024 20:541,644,47313,721,025,13513,649,125,97302,256,896
3Feb 3, 2024 21:121,645,02513,714,208,15513,653,708,44702,252,800
4Feb 3, 2024 20:541,645,53813,729,051,74013,657,965,80302,248,704
5Feb 3, 2024 21:121,645,70413,740,694,80513,659,340,10102,260,992
6Feb 3, 2024 20:541,645,74313,712,528,76613,659,665,68502,269,184