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 19, 2024 01:08zielajzielajScore: 3,717Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 19, 2024 01:083,55455,898,25329,501,00002,523,136
2Nov 19, 2024 01:083,66454,820,93529,395,0001,013,0002,531,328
3Nov 19, 2024 01:083,69156,895,01530,638,00002,269,184
4Nov 19, 2024 01:083,71759,826,60129,860,000995,0002,523,136
5Nov 19, 2024 01:083,72552,080,19129,917,000997,0002,265,088
6Nov 19, 2024 01:083,73354,378,40029,986,000999,0002,445,312