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 27, 2024 01:57Joad NacerJoad NacerScore: 4,329Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 27, 2024 01:574,27061,690,00733,415,0002,025,0002,531,328
2Nov 27, 2024 01:574,31863,131,11833,848,0001,991,0002,306,048
3Nov 27, 2024 01:574,31964,494,55633,860,0001,991,0002,273,280
4Nov 27, 2024 01:574,32957,750,48534,936,000998,0002,297,856
5Nov 27, 2024 01:574,51364,052,07035,430,0002,024,0002,297,856
6Nov 27, 2024 01:574,57365,135,97535,960,0001,997,0002,301,952