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 16, 2024 01:56zielajzielajScore: 3,758Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 16, 2024 01:563,52350,846,29728,232,0001,008,0002,347,008
2Nov 16, 2024 01:563,59658,015,64829,850,00002,347,008
3Nov 16, 2024 01:563,59754,907,36327,866,0001,990,0002,347,008
4Nov 16, 2024 01:563,75852,899,74029,182,0002,012,0002,363,392
5Nov 16, 2024 01:563,78753,043,88830,422,0001,014,0002,363,392
6Nov 16, 2024 01:563,79648,928,72231,509,00002,531,328