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 6, 2024 10:30Evgen BodunovEvgen BodunovScore: 545,161Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 6, 2024 10:30544,7634,550,072,7674,463,563,00057,968,0002,289,664
2Nov 6, 2024 10:30544,9264,548,298,4534,443,923,00078,963,0002,293,760
3Nov 6, 2024 10:30544,9904,552,450,5204,459,452,00063,963,0002,285,568
4Nov 6, 2024 10:30545,0524,547,496,6674,422,982,000100,953,0002,285,568
5Nov 6, 2024 10:30545,1614,556,093,5494,449,891,00074,947,0002,510,848
6Nov 6, 2024 10:30546,3524,564,931,1604,454,779,00079,942,0002,285,568
7Nov 6, 2024 10:30546,4304,565,250,3174,454,414,00080,953,0002,289,664
8Nov 6, 2024 10:30546,4654,566,155,1464,470,697,00064,966,0002,293,760
9Nov 6, 2024 10:30546,6834,564,223,4004,464,507,00072,959,0002,285,568