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 6, 2023 11:09Huy Duc LeHuy Duc LeScore: 62,424Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2023 11:0962,418585,511,987518,067,96902,195,456
2Jul 6, 2023 11:0962,424582,924,346518,117,26502,256,896
3Jul 6, 2023 11:0962,528586,960,886518,979,56002,199,552