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 listMay 28, 2024 22:03Samuel MurphySamuel MurphyScore: 1,646,645Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 28, 2024 22:341,646,04013,718,489,37813,662,131,71602,260,992
2May 28, 2024 22:031,646,07413,715,580,43613,662,413,67902,260,992
3May 28, 2024 22:341,646,27013,737,616,30313,664,038,62402,273,280
4May 28, 2024 22:031,646,64513,734,924,33013,667,156,09402,260,992
5May 28, 2024 22:031,646,71213,733,772,96713,667,710,81702,256,896
6May 28, 2024 22:341,651,18313,767,140,53213,704,816,44002,260,992