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 listNov 3, 2024 19:55zielajzielajScore: 15,253Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 3, 2024 19:5515,246152,933,554124,552,0001,992,0002,273,280
2Nov 3, 2024 19:5515,248154,616,496125,556,0001,004,0002,535,424
3Nov 3, 2024 19:5515,252151,541,932126,592,00002,535,424
4Nov 3, 2024 19:5515,253152,741,127126,604,00002,273,280
5Nov 3, 2024 19:5515,253158,649,147126,603,00002,535,424
6Nov 3, 2024 19:5515,254153,160,286125,604,0001,004,0002,273,280
7Nov 3, 2024 19:5515,277151,176,565124,803,0001,996,0002,433,024
8Nov 3, 2024 19:5515,279157,716,332125,821,000998,0002,428,928
9Nov 3, 2024 19:5515,280157,238,625125,824,000998,0002,433,024