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 15, 2024 12:23Uladzislau NestsiarukUladzislau NestsiarukScore: 482,986Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 15, 2024 12:23481,4304,024,772,6493,919,913,00075,959,0002,281,472
2Nov 15, 2024 12:23482,4994,032,432,1683,942,773,00061,965,0002,281,472
3Nov 15, 2024 12:23482,6304,034,165,4393,946,860,00058,968,0002,289,664
4Nov 15, 2024 12:23482,8174,033,058,7723,950,405,00056,977,0002,281,472
5Nov 15, 2024 12:23482,9864,033,301,1133,942,819,00065,963,0002,289,664
6Nov 15, 2024 12:23483,2964,040,057,0323,952,383,00058,975,0002,269,184
7Nov 15, 2024 12:23486,2894,058,992,1913,971,231,00064,971,0002,289,664
8Nov 15, 2024 12:23486,7894,067,680,9443,965,381,00074,969,0002,265,088
9Nov 15, 2024 12:23491,9574,111,654,1204,015,277,00067,970,0002,281,472