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 11, 2024 09:42ZOTTIGZOTTIGScore: 100,094Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 11, 2024 09:4299,915860,412,786768,350,00060,948,0002,297,856
2Nov 11, 2024 09:42100,005858,675,950772,039,00058,002,0002,326,528
3Nov 11, 2024 09:42100,037856,570,566767,362,00062,947,0002,531,328
4Nov 11, 2024 09:42100,072862,524,379769,626,00060,970,0002,322,432
5Nov 11, 2024 09:42100,094856,787,547769,795,00060,983,0002,363,392
6Nov 11, 2024 09:42100,123860,165,026766,023,00065,001,0002,314,240
7Nov 11, 2024 09:42100,135857,218,887770,113,00061,009,0002,330,624
8Nov 11, 2024 09:42100,170856,775,967770,456,00060,957,0002,318,336
9Nov 11, 2024 09:42100,272860,613,750767,315,00064,942,0002,310,144