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 15, 2024 08:18Nadiminty KaundinyaNadiminty KaundinyaScore: 484,766Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 15, 2024 08:18484,6824,084,437,5434,022,861,57002,260,992
2Jul 15, 2024 08:18484,7664,081,250,8064,023,553,99402,260,992
3Jul 15, 2024 08:18488,5654,116,962,5174,055,087,70802,260,992