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 13, 2024 03:06bgimby-nsbgimby-nsScore: 471,328Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 13, 2024 03:06470,9783,973,097,0303,909,116,61602,252,800
2Jul 13, 2024 03:06471,3283,973,283,3713,912,021,05202,232,320
3Jul 13, 2024 03:06471,7973,979,075,5193,915,911,76902,232,320