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 22, 2024 11:080xUBN0xUBNScore: 415,729Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 22, 2024 11:08414,9843,513,425,0253,444,367,44502,199,552
2Jul 22, 2024 11:08415,7293,526,517,6673,450,551,64102,195,456
3Jul 22, 2024 11:08417,9973,545,518,7003,469,375,04302,326,528