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:43Manuel PepeManuel PepeScore: 121,633Success
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:43121,6041,035,139,1411,005,318,0003,997,0002,326,528
2Nov 14, 2024 22:43121,6051,037,963,7531,006,321,0002,997,0002,482,176
3Nov 14, 2024 22:43121,6071,034,993,1551,003,341,0005,996,0002,326,528
4Nov 14, 2024 22:43121,6271,037,624,8931,005,506,0003,998,0002,326,528
5Nov 14, 2024 22:43121,6331,038,687,8851,007,557,0001,999,0002,318,336
6Nov 14, 2024 22:43121,6471,038,372,6371,006,669,0002,999,0002,338,816
7Nov 14, 2024 22:43121,6531,035,985,5891,006,716,0003,002,0002,326,528
8Nov 14, 2024 22:43121,6571,035,264,4891,004,754,0004,998,0002,326,528
9Nov 14, 2024 22:43121,6621,040,074,7641,006,793,0002,999,0002,326,528