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 listJul 3, 2023 12:45Erdem KeskinErdem KeskinScore: 83,898Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2023 12:3683,882757,678,854696,224,54302,220,032
2Jul 3, 2023 12:4583,882754,155,119696,223,71002,228,224
3Jul 4, 2023 14:1383,891754,213,799696,297,94502,236,416
4Jul 4, 2023 14:1383,895766,247,101696,330,83102,228,224
5Jul 3, 2023 12:3683,898777,442,656696,352,03202,244,608
6Jul 3, 2023 12:3683,901768,635,753696,376,45902,240,512
7Jul 3, 2023 12:4583,902779,423,462696,390,19402,228,224
8Jul 3, 2023 12:4583,903754,715,484696,398,45002,232,320
9Jul 4, 2023 14:1383,907774,518,669696,425,97302,228,224