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 4, 2023 14:55Erdem KeskinErdem KeskinScore: 83,907Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2023 17:2483,886761,319,277696,252,92002,232,320
2Jul 4, 2023 17:2483,890755,342,986696,285,26802,228,224
3Jul 4, 2023 14:5583,891767,326,829696,297,48802,240,512
4Jul 4, 2023 17:2483,907753,486,840696,424,37702,232,320
5Jul 4, 2023 14:5583,982765,856,201697,052,70402,236,416
6Jul 4, 2023 14:5583,989758,580,754697,106,75202,240,512