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 02:00zielajzielajScore: 7,474Success
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 02:006,08672,843,53150,516,00002,424,832
2Nov 11, 2024 02:006,09175,448,89850,556,00002,428,928
3Nov 11, 2024 02:006,26078,567,12750,960,000999,0002,424,832
4Nov 11, 2024 02:007,47487,238,23761,037,0001,000,0002,269,184
5Nov 11, 2024 02:007,53785,928,62162,560,00002,428,928
6Nov 11, 2024 02:007,59883,929,31662,060,0001,000,0002,428,928