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 listSep 13, 2025 18:50Tony SolomonikTony SolomonikScore: 68,058Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 13, 2025 18:5067,867592,166,278499,266,00064,034,0002,355,200
2Sep 13, 2025 18:5067,928587,451,564513,823,00049,982,0002,281,472
3Sep 13, 2025 18:5067,956587,304,023499,033,00065,004,0002,285,568
4Sep 13, 2025 18:5067,980584,687,653503,208,00061,025,0002,359,296
5Sep 13, 2025 18:5068,058593,057,728506,896,00057,988,0002,281,472
6Sep 13, 2025 18:5068,137594,152,857484,605,00080,934,0002,359,296
7Sep 13, 2025 18:5068,319589,135,135503,044,00064,005,0002,285,568
8Sep 13, 2025 18:5068,383598,494,501491,633,00075,943,0002,355,200
9Sep 13, 2025 18:5068,393594,063,656501,701,00065,960,0002,363,392