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 18, 2024 01:33zielajzielajScore: 3,727Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 18, 2024 01:333,50952,062,51227,114,0002,008,0002,375,680
2Nov 18, 2024 01:333,54065,225,81429,381,00002,514,944
3Nov 18, 2024 01:333,54155,446,47029,392,00002,375,680
4Nov 18, 2024 01:333,72755,673,26128,941,0001,995,0002,396,160
5Nov 18, 2024 01:333,92959,145,12531,594,0001,019,0002,260,992
6Nov 18, 2024 01:333,99358,798,66031,133,0002,008,0002,265,088